Golang使用切片实现单链表的示例代码

type HeroNode struct {
	no   int
	name string
	next *HeroNode 
}

func InputNode(head *HeroNode, hero *HeroNode) {
	text := head
	for {
		if text.next == nil {
			break
		}
		text = text.next
	}
	text.next = hero
}

func InputNode2(head *HeroNode, hero *HeroNode) {
	text := head
	flag := true
	//让插入的节点的no，和text的下一个节点的no进行比较
	for {
		if text.next == nil {
			break
		} else if text.next.no > hero.no {
			//说明hero应该插入到text后面
			break
		} else if text.next.no == hero.no {
			flag = false
			break
		}
		text = text.next
	}
	if !flag {
		fmt.Println("已经存在", hero.no)
		return
	} else {
		hero.next = text.next
		text.next = hero
	}
}

func DelectNode(hero *HeroNode, id int) {
	text := hero
	flag := false
	for {
		if text.next == nil {
			break
		} else if text.next.no == id {
			//说明找到了
			flag = true
			break
		}
		text = text.next
	}
	if flag {
		text.next = text.next.next
	} else {
		fmt.Println("删除id不存在", id)
	}
}

func ShowNode(head *HeroNode) {
	//	创建一个辅助节点
	text := head
	//	判断是否为空链表
	if text.next == nil {
		fmt.Println("空链表")
		return
	}
	for {
		fmt.Printf("[%d ,%s ]==>", text.next.no, text.next.name)
		text = text.next
		if text.next == nil {
			break
		}
	}
}

func main() {
	//	创建根节点
	head := &HeroNode{}
	hero1 := &HeroNode{
		no:   1,
		name: "张明",
	}
	hero2 := &HeroNode{
		no:   2,
		name: "李华",
	}
	hero3 := &HeroNode{
		no:   3,
		name: "王五",
	}
	hero4 := &HeroNode{
		no:   4,
		name: "张三",
	}
	hero5 := &HeroNode{
		no:   5,
		name: "花花",
	}
	InputNode2(head, hero1)
	InputNode2(head, hero2)
	InputNode2(head, hero3)
	InputNode2(head, hero4)
	InputNode2(head, hero5)
	ShowNode(head)
	fmt.Println()
	DelectNode(head, 1)
	ShowNode(head)
}