Go实现单链表

package main

import "fmt"

type student struct {
	age  int
	name string
	next *student
}

// 实现单链表
func main() {
	// 创建头结点
	head := &student{}
	// 创建第一个节点
	first := &student{
		age:  20,
		name: "zs",
	}
	// 创建第二个节点
	second := &student{
		age:  30,
		name: "ls",
	}
	// 创建第三个节点
	three := &student{
		age:  40,
		name: "ww",
	}
	// 创建第四个节点
	four := &student{
		age:  20,
		name: "zl",
	}
	head.next = first
	first.next = second
	second.next = three
	
	// 调试按年龄插入
	list(head)
	four.next = nil
	isOk := insertByAge(head, second, four)
	fmt.Println(isOk)
	list(head)
}

/**
  实现尾插
*/
func insert(head *student, newNode *student) {
	//1.先顺序遍历找到尾节点
	//2.创建一个临时指针
	temp := head
	for {
		if temp.next == nil {
			break
		}
		temp = temp.next
	}
	temp.next = newNode
}

/**
实现遍历
*/
func list(head *student) {
	temp := head
	for {
		if temp.next == nil {
			break
		}
		next := temp.next
		fmt.Printf("student : age : %d, name : %s   \n", next.age, next.name)
		temp = temp.next
	}
}

/**
实现按条件插入 : 若新节点年龄大于指定的节点,插入在其后,否则不插入
*/
func insertByAge(head *student, NodeByAgeSort *student, ageNode *student) bool {
	// 先找到这个节点
	temp := head
	for {
		if temp == NodeByAgeSort && NodeByAgeSort.age != 0 && temp.age < ageNode.age {
			// 进入插入
			next := temp.next
			// 新节点指向当前节点
			ageNode.next = next
			temp.next = ageNode
			return true
		}
		temp = temp.next
		if temp.next == nil {
			return false
		}
	}
}

输出:
student : age : 20, name : zs
student : age : 30, name : ls
student : age : 40, name : ww
false
student : age : 20, name : zs
student : age : 30, name : ls
student : age : 40, name : ww