package main
import (
"fmt"
)
//定義結構體 注意點:go不支持類型別名,type與C語言中的typedef並不一樣
/*
var a int
a = 3
type INT int
var b INT
b = 3
fmt.Println(a == b)
報錯:invalid operation: a == b (mismatched types int and INT)
*/
type Node struct {
Value int
Next *Node
}
//測試鏈表是否爲空
func IsEmpty(list *Node) bool {
return list == nil
}
//測試是否爲最後節點
func IsLast(position *Node, list *Node) bool {
return position.Next == nil
}
func Find(value int, list *Node) *Node {
p := list
for p.Value != value {
p = p.Next
}
return p
}
//插入節點
func Insert(value int, list *Node, position *Node) {
tempCell := new(Node)
if tempCell == nil {
fmt.Println("out of space!")
}
tempCell.Value = value
tempCell.Next = position.Next
position.Next = tempCell
}
//刪除節點
func Delete(value int, list *Node) {
pPrev := FindPrevious(value, list)
p := Find(value, list)
pPrev.Next = p.Next
p = nil
}
func FindPrevious(value int, list *Node) *Node{
p := list
for p.Next != nil && p.Next.Value != value {
p = p.Next
}
return p
}
//刪除鏈表 注意點:Golang中函數傳遞指針變量,其實是傳遞實參
func DeleteList(list **Node) {
p := list
for *p != nil {
tmp := *p
*p = nil
*p = tmp.Next
}
}
//打印列表
func PrintList(list *Node) {
p := list
for p != nil {
fmt.Printf("%d-%p-%p ", p.Value, p, p.Next)
p = p.Next
}
fmt.Println()
}
func main() {
headNode := &Node{
Value:0,
Next:nil,
}
list := headNode
Insert(1, list, headNode)
PrintList(list)
fmt.Println(IsEmpty(list))
fmt.Println(IsLast(headNode, list))
p := Find(0, list)
Insert(2, list, p)
PrintList(list)
Delete(1, list)
PrintList(list)
DeleteList(&list)
PrintList(list)
}
Golang實現單鏈表
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.