上一篇寫了如何來生成鏈表，這一篇介紹鏈表的基本操作。

1.求表長(zhǎng)

表長(zhǎng)就是鏈表中結(jié)點(diǎn)的個(gè)數(shù)

type Teacher struct{ //定義鏈表類型Name stringAge intNext *Teacher
}
func printList(h *Teacher){ //循環(huán)打印每個(gè)元素for h != nil{fmt.Printf("Name:%v Age:%v\n",h.Name,h.Age)h = h.Next}
}
func createInHeader(h *Teacher, name string, age int) (*Teacher) {p := &Teacher{}p.Age = agep.Name = namep.Next = hreturn p
}
func LenLinkList(h *Teacher) int {
//求表長(zhǎng)var cnt intif h == nil{  //如果h的值為空則cnt為0，否則為1，return cnt}else{cnt=1}for h.Next != nil{h= h.Next  //每后移一個(gè)結(jié)點(diǎn)，cnt加1cnt++}return cnt
}
func testCreateInHeader() {var header *Teacherheader = createInHeader(header, "a", 18)header = createInHeader(header, "b", 19)header = createInHeader(header, "c", 20)printList(header)cnt := LenLinkList(header)fmt.Printf("鏈表的長(zhǎng)度是：%d\n",cnt)}
//輸出結(jié)果：
Name:c Age:20
Name:b Age:19
Name:a Age:18
鏈表的長(zhǎng)度是：3

　　2.讀表元素

通常給定一個(gè)序號(hào)i,查找表的第i個(gè)元素。在鏈表中，任何相鄰的兩個(gè)結(jié)點(diǎn)通過一個(gè)指針相連，一個(gè)結(jié)點(diǎn)的位置包含在前邊結(jié)點(diǎn)的next域中。所以，必須從頭指針出發(fā)，一直往后移動(dòng)，直到第i個(gè)結(jié)點(diǎn)

type Teacher struct{Name stringAge intNext *Teacher
}
func createInHeader(h *Teacher, name string, age int) (*Teacher) {p := &Teacher{}p.Age = agep.Name = namep.Next = hreturn p
}
func printList(h *Teacher){for h != nil{fmt.Printf("Name:%v Age:%v\n",h.Name,h.Age)h = h.Next}
}
func GetLinkList(h *Teacher,i int)*Teacher{//讀表元素c:= 1for c<i && h != nil{//當(dāng)未到第i結(jié)點(diǎn)且未到尾結(jié)點(diǎn)時(shí)繼續(xù)后移h = h.Nextc++}if i==c{   //找到第i個(gè)結(jié)點(diǎn)return h}else{return nil   //i<1或i>n,i值不合法，查找失敗}
}
func testCreateInHeader() {var header *Teacherheader = createInHeader(header, "a", 18)header = createInHeader(header, "b", 19)header = createInHeader(header, "c", 20)printList(header)cnt := LenLinkList(header)fmt.Printf("鏈表的長(zhǎng)度是：%d\n",cnt)fmt.Printf("鏈表的第二個(gè)元素是：%v\n",*(GetLinkList(header,2)))//讀表元素fmt.Printf("鏈表的第三個(gè)元素是：%v\n",*(GetLinkList(header,3)))// fmt.Printf("鏈表的第四個(gè)元素是：%v\n",*(GetLinkList(header,4)))//panic}
//運(yùn)行結(jié)果
Name:c Age:20
Name:b Age:19
Name:a Age:18
鏈表的長(zhǎng)度是：3
鏈表的第二個(gè)元素是：{b 19 0xc0420023e0}
鏈表的第三個(gè)元素是：{a 18 <nil>}

　　3.定位

定位運(yùn)算，就是給定表元素的值，找出這個(gè)元素的位置，若找到返回元素是鏈表的第幾個(gè)結(jié)點(diǎn)，未找到返回0

func LocateLinkList(h *Teacher,name string, age int) int{i:=0for h !=nil && (h.Name != name || h.Age != age){i++h = h.Next}if h != nil{return i+1}else{return 0}
}

　　4.插入

插入運(yùn)算是將給定值的元素插入第i個(gè)結(jié)點(diǎn)之前。先找到鏈表的第i-1個(gè)結(jié)點(diǎn)q,然后，生成一個(gè)新結(jié)點(diǎn)p,p的指針指向q的后一個(gè)結(jié)點(diǎn)，q指向p,這樣完成插入運(yùn)算。

type Teacher struct{Name stringAge intNext *Teacher
}
func createInHeader(h *Teacher, name string, age int) (*Teacher) {p := &Teacher{}p.Age = agep.Name = namep.Next = hreturn p
}
func printList(h *Teacher){for h != nil{fmt.Printf("Name:%v Age:%v\n",h.Name,h.Age)h = h.Next}
}
func GetLinkList(h *Teacher,i int)*Teacher{//讀表元素c:= 1for c<i && h != nil{//當(dāng)未到第i結(jié)點(diǎn)且未到尾結(jié)點(diǎn)時(shí)繼續(xù)后移h = h.Nextc++}if i==c{   //找到第i個(gè)結(jié)點(diǎn)return h}else{return nil   //i<1或i>n,i值不合法，查找失敗}
}
func InserLinkList(h *Teacher,name string,age int,i int){var q *Teachervar p *Teacherif i ==1 {q = h}else{q = GetLinkList(h,i-1)//查找第i-1個(gè)元素結(jié)點(diǎn)}if q == nil{                  //第i-1個(gè)結(jié)點(diǎn)不存在return}else{p = new(Teacher)    //生成新的結(jié)點(diǎn)p.Name = namep.Age = agep.Next = q.Next   //新結(jié)點(diǎn)的指針指向第i-1個(gè)結(jié)點(diǎn)的指針指向的值q.Next = p        //第i-1個(gè)結(jié)點(diǎn)指向新生成的結(jié)點(diǎn)}
}
func testCreateInHeader() {var header *Teacherheader = createInHeader(header, "a", 18)header = createInHeader(header, "b", 19)header = createInHeader(header, "c", 20)printList(header)InserLinkList(header,"d",21,2)fmt.Println("插入之后")printList(header)
}
//運(yùn)行結(jié)果
Name:c Age:20
Name:b Age:19
Name:a Age:18
插入之后
Name:c Age:20
Name:d Age:21
Name:b Age:19
Name:a Age:18

　　

?

轉(zhuǎn)載于:https://www.cnblogs.com/wanghaijun999/p/8145446.html

總結(jié)

以上是生活随笔為你收集整理的go 语言 链表 的增删改查的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。