網(wǎng)站首頁(yè) 編程語(yǔ)言 正文
任意類(lèi)型的數(shù)據(jù)域
之前的鏈表定義數(shù)據(jù)域都是整型int，如果需要不同類(lèi)型的數(shù)據(jù)就要用到 interface{}。
空接口 interface{}
對(duì)于描述起不到任何的作用(因?yàn)樗话魏蔚膍ethod），但interface{}在需要存儲(chǔ)任意類(lèi)型的數(shù)值的時(shí)候相當(dāng)有用，因?yàn)樗梢源鎯?chǔ)任意類(lèi)型的數(shù)值。
一個(gè)函數(shù)把interface{}作為參數(shù)，那么它可以接受任意類(lèi)型的值作為參數(shù)；如果一個(gè)函數(shù)返回interface{}，那么也就可以返回任意類(lèi)型的值，類(lèi)似于C語(yǔ)言的void*類(lèi)型。
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type List struct {
head *Node
}
func (list *List) push(value interface{}) {
node := &Node{data: value}
p := list.head
if p != nil {
for p.next != nil {
p = p.next
}
p.next = node
} else {
list.head = node
}
}
func (list *List) travel() {
p := list.head
for p != nil {
fmt.Print(p.data)
p = p.next
if p != nil {
fmt.Print("->")
}
}
fmt.Println("<nil>")
}
func main() {
node := new(List)
node.push("abc")
node.push(3.142)
node.push('a')
node.push(3 + 4i)
node.push([]int{1, 2, 3})
node.push([8]byte{'a', 3: 'd'})
node.push(Node{1, &Node{2, nil}}.data)
node.push(Node{1, &Node{2, nil}}.next)
node.travel()
}
/*輸出：
abc->3.142->97->(3+4i)->[1 2 3]->[97 0 0 100 0 0 0 0]->1->&{2 <nil>}<nil>
*/實(shí)例01
把字串中漢字除外的所有字符逐個(gè)存入鏈表，且數(shù)字以整型保存。?
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type List struct {
head *Node
}
func (list *List) push(value interface{}) {
node := &Node{data: value}
p := list.head
if p != nil {
for p.next != nil {
p = p.next
}
p.next = node
} else {
list.head = node
}
}
func (list *List) travel() {
p := list.head
for p != nil {
fmt.Print(p.data)
p = p.next
if p != nil {
fmt.Print("->")
}
}
fmt.Println("<nil>")
}
func main() {
node := new(List)
str := "Golang數(shù)據(jù)結(jié)構(gòu)123:單鏈表0789"
for _, s := range str {
if s >= 48 && s < 58 {
node.push(s - 48)
} else if s < 128 {
node.push(string(s))
}
}
node.travel()
}
/*輸出：
G->o->l->a->n->g->1->2->3->:->0->7->8->9<nil>
*/快慢指針
給單鏈表設(shè)置2個(gè)指針，其中一個(gè)指針先移動(dòng)n個(gè)節(jié)點(diǎn)，然后同時(shí)移動(dòng)這2個(gè)指針，那么當(dāng)先移動(dòng)的指針到達(dá)尾部時(shí)，后移動(dòng)的那個(gè)指針就是倒數(shù)第 n 個(gè)節(jié)點(diǎn)。先移動(dòng)的指針?lè)Q“快指針”，后出發(fā)的指針?lè)Q“慢指針”，其實(shí)一樣“快”只是出發(fā)有先后。
實(shí)例02
刪除鏈表中倒數(shù)第 n 個(gè)結(jié)點(diǎn)
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type List struct {
head *Node
}
func (list *List) removNthBack(n int) {
if n > list.size() {
panic("range error: n <= List's size")
}
var fast, slow *Node
head := list.head
fast = head
slow = head
for i := 0; i < n; i++ {
fast = fast.next
}
if fast == nil {
list.head = head.next
return
}
for fast.next != nil {
fast = fast.next
slow = slow.next
}
slow.next = slow.next.next
}
func removNthBack(list *List, n int) *List {
if n > list.size() {
panic("range error: n <= List's size")
}
var fast, slow *Node
head := list.head
fast = head
slow = head
for i := 0; i < n; i++ {
fast = fast.next
}
if fast == nil {
list.head = head.next
return list
}
for fast.next != nil {
fast = fast.next
slow = slow.next
}
slow.next = slow.next.next
return list
}
func (list *List) push(value interface{}) {
node := &Node{data: value}
p := list.head
if p != nil {
for p.next != nil {
p = p.next
}
p.next = node
} else {
list.head = node
}
}
func (list *List) size() int {
length := 0
for p := list.head; p != nil; p = p.next {
length++
}
return length
}
func (list *List) travel() {
p := list.head
for p != nil {
fmt.Print(p.data)
p = p.next
if p != nil {
fmt.Print("->")
}
}
fmt.Println("<nil>")
}
func main() {
lst := new(List)
str := "12309"
for _, s := range str {
lst.push(s - 48)
}
lst.travel()
lst.removNthBack(3)
lst.travel()
lst = removNthBack(lst, 3)
lst.travel()
lst.removNthBack(2)
lst.travel()
//lst.removNthBack(10) //panic error
lst.removNthBack(2)
lst.travel()
lst.removNthBack(1)
lst.travel()
//lst.removNthBack(1) //panic error
}
/*輸出：
1->2->3->0->9<nil>
1->2->0->9<nil>
1->0->9<nil>
1->9<nil>
9<nil>
<nil>
*/反轉(zhuǎn)鏈表
遍歷一個(gè)鏈表，每個(gè)結(jié)點(diǎn)用頭插法相接的新鏈表就是原鏈表的反轉(zhuǎn)結(jié)果。
實(shí)例03
反轉(zhuǎn)整個(gè)鏈表
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type List struct {
head *Node
}
func (list *List) reverse() {
res := &List{}
for p := list.head; p != nil; p = p.next {
node := &Node{p.data, nil}
node.next = res.head
res.head = node
}
list.head = res.head
}
func (list *List) pushHead(value interface{}) {
node := &Node{data: value}
node.next = list.head
list.head = node
}
func (list *List) build(lst []interface{}) {
for i := len(lst) - 1; i >= 0; i-- {
node := &Node{data: lst[i]}
node.next = list.head
list.head = node
}
}
func (list *List) clear() {
list.head = nil
}
func (list *List) travel() {
p := list.head
for p != nil {
fmt.Print(p.data)
p = p.next
if p != nil {
fmt.Print("->")
}
}
fmt.Println("<nil>")
}
func main() {
lst := new(List)
for n := 5; n > 0; n-- {
lst.pushHead(n)
}
lst.travel()
lst.reverse()
lst.travel()
lst.clear()
lst.build([]interface{}{6.13, "/", 100000, "Hann", 1.0e-5})
lst.travel()
lst.reverse()
lst.travel()
}
/*輸出：
1->2->3->4->5<nil>
5->4->3->2->1<nil>
6.13->/->100000->Hann->1e-05<nil>
1e-05->Hann->100000->/->6.13<nil>
*/實(shí)例04
反轉(zhuǎn)鏈表的其中一段，反轉(zhuǎn)從第m個(gè)結(jié)點(diǎn)到n個(gè)結(jié)點(diǎn)(其中0<m<=n<=length of List)
Input: 1->2->3->4->5->nil, m = 2, n = 4
Output: 1->4->3->2->5->nil
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type List struct {
head *Node
}
func reverseBetween(list *List, m int, n int) *List {
list = list.Copy()
head := list.head
if head == nil || m >= n {
return list
}
if m < 1 { //防止范圍左端超限
m = 1
}
node := &Node{0, head}
p := node
for i := 0; p.next != nil && i < m-1; i++ {
p = p.next
}
if p.next == nil {
return list
}
cur := p.next
for i := 0; i < n-m && cur.next != nil; i++ {
//由cur.next != nil防止范圍右端超限
tmp := p.next
p.next = cur.next
cur.next = cur.next.next
p.next.next = tmp
}
list.head = node.next
return list
}
func (list *List) reverseBetween(m int, n int) {
head := list.head
if head == nil || m >= n {
return
}
if m < 1 { //防止范圍左端超限
m = 1
}
node := &Node{0, head}
p := node
for i := 0; p.next != nil && i < m-1; i++ {
p = p.next
}
if p.next == nil {
return
}
cur := p.next
for i := 0; i < n-m && cur.next != nil; i++ {
//由cur.next != nil防止范圍右端超限
tmp := p.next
p.next = cur.next
cur.next = cur.next.next
p.next.next = tmp
}
list.head = node.next
}
func (list *List) pushHead(value interface{}) {
node := &Node{data: value}
node.next = list.head
list.head = node
}
func (list *List) build(lst []interface{}) {
for i := len(lst) - 1; i >= 0; i-- {
node := &Node{data: lst[i]}
node.next = list.head
list.head = node
}
}
func (list *List) Copy() *List {
p := list.head
res := &List{}
if p != nil {
node := &Node{p.data, nil}
q := node
for p = p.next; p != nil; p = p.next {
q.next = &Node{p.data, nil}
q = q.next
}
res.head = node
}
return res
}
func (list *List) travel() {
p := list.head
for p != nil {
fmt.Print(p.data)
p = p.next
if p != nil {
fmt.Print("->")
}
}
fmt.Println("<nil>")
}
func main() {
list1 := new(List)
list2 := new(List)
for n := 5; n > 0; n-- {
list1.pushHead(n)
}
list1.travel()
list2 = reverseBetween(list1, 2, 4)
list2.travel()
list2 = reverseBetween(list1, 2, 3)
list2.travel()
list2 = reverseBetween(list1, 2, 5)
list2.travel()
list2 = reverseBetween(list1, 2, 6)
list2.travel()
list2 = reverseBetween(list1, 1, 6)
list2.travel()
list2 = reverseBetween(list1, 0, 3)
list2.travel()
list1.reverseBetween(1, 3)
list1.travel()
}
/*輸出：
1->2->3->4->5<nil>
1->4->3->2->5<nil>
1->3->2->4->5<nil>
1->5->4->3->2<nil>
1->5->4->3->2<nil>
5->4->3->2->1<nil>
3->2->1->4->5<nil>
3->2->1->4->5<nil>
*/交換節(jié)點(diǎn)
實(shí)例05
鏈表的相鄰節(jié)點(diǎn)兩兩交換位置
Given 1->2->3->4, you should return the list as 2->1->4->3.
package main
import "fmt"
type Node struct {
data interface{}
next *Node
}
type List struct {
head *Node
}
func (list *List) swapPairs() {
p := list.head
if p == nil || p.next == nil {
return
}
head := p.next
var node, node2 *Node
for p.next != nil {
cur := p.next
if node != nil && node.next != nil {
node.next = cur
}
if p.next.next != nil {
node2 = p.next.next
}
if p.next.next != nil {
p.next = node2
} else {
p.next = nil
}
cur.next = p
node = p
if p.next != nil {
p = node2
}
}
list.head = head
}
func swapPairs(list *List) *List {
list = list.Copy()
p := list.head
if p == nil || p.next == nil {
return list
}
head := p.next
var node, node2 *Node
for p.next != nil {
cur := p.next
if node != nil && node.next != nil {
node.next = cur
}
if p.next.next != nil {
node2 = p.next.next
}
if p.next.next != nil {
p.next = node2
} else {
p.next = nil
}
cur.next = p
node = p
if p.next != nil {
p = node2
}
}
list.head = head
return list
}
func (list *List) Copy() *List {
p := list.head
res := &List{}
if p != nil {
node := &Node{p.data, nil}
q := node
for p = p.next; p != nil; p = p.next {
q.next = &Node{p.data, nil}
q = q.next
}
res.head = node
}
return res
}
func (list *List) build(lst []interface{}) {
for i := len(lst) - 1; i >= 0; i-- {
node := &Node{data: lst[i]}
node.next = list.head
list.head = node
}
}
func (list *List) travel() {
p := list.head
for p != nil {
fmt.Print(p.data)
p = p.next
if p != nil {
fmt.Print("->")
}
}
fmt.Println("<nil>")
}
func main() {
list1 := new(List)
list2 := new(List)
list1.build([]interface{}{1, 2, 3, 4, 5, 6})
list1.travel()
list2 = swapPairs(list1)
list2.travel()
list2 = &List{&Node{0, nil}}
list2.head.next = list1.Copy().head
list2.travel()
list2.swapPairs()
list2.travel()
}
/*輸出：
1->2->3->4->5->6<nil>
2->1->4->3->6->5<nil>
0->1->2->3->4->5->6<nil>
1->0->3->2->5->4->6<nil>
*/
原文鏈接：https://blog.csdn.net/boysoft2002/article/details/126490925
相關(guān)推薦
- 2023-01-19 GO語(yǔ)言的數(shù)組array與切片slice詳解_Golang
- 2023-02-07 GoLang?sync.Pool簡(jiǎn)介與用法_Golang
- 2022-04-21 C#?TrackBar拖動(dòng)條改變滑塊顏色_C#教程
- 2022-02-02 Maven命令安裝本地jar包到本地倉(cāng)庫(kù)
- 2022-05-27 Linux?創(chuàng)建oracle數(shù)據(jù)庫(kù)的詳細(xì)過(guò)程_oracle
- 2023-02-06 python常見(jiàn)讀取語(yǔ)音的3種方法速度對(duì)比_python
- 2022-07-24 詳解Flutter中StatefulBuilder組件的使用_Android
- 2022-10-10 VMware?Workstation與Device/Credential?Guard不兼容的解決_V
- 最近更新
-
- window11 系統(tǒng)安裝 yarn
- 超詳細(xì)win安裝深度學(xué)習(xí)環(huán)境2025年最新版（
- Linux 中運(yùn)行的top命令 怎么退出？
- MySQL 中decimal 的用法？ 存儲(chǔ)小
- get 、set 、toString 方法的使
- @Resource和 @Autowired注解
- Java基礎(chǔ)操作-- 運(yùn)算符，流程控制 Flo
- 1. Int 和Integer 的區(qū)別，Jav
- spring @retryable不生效的一種
- Spring Security之認(rèn)證信息的處理
- Spring Security之認(rèn)證過(guò)濾器
- Spring Security概述快速入門(mén)
- Spring Security之配置體系
- 【SpringBoot】SpringCache
- Spring Security之基于方法配置權(quán)
- redisson分布式鎖中waittime的設(shè)
- maven:解決release錯(cuò)誤：Artif
- restTemplate使用總結(jié)
- Spring Security之安全異常處理
- MybatisPlus優(yōu)雅實(shí)現(xiàn)加密？
- Spring ioc容器與Bean的生命周期。
- 【探索SpringCloud】服務(wù)發(fā)現(xiàn)-Nac
- Spring Security之基于HttpR
- Redis 底層數(shù)據(jù)結(jié)構(gòu)-簡(jiǎn)單動(dòng)態(tài)字符串（SD
- arthas操作spring被代理目標(biāo)對(duì)象命令
- Spring中的單例模式應(yīng)用詳解
- 聊聊消息隊(duì)列，發(fā)送消息的4種方式
- bootspring第三方資源配置管理
- GIT同步修改后的遠(yuǎn)程分支
提供CDN加速