golang数据结构之双链表

package link

import (
    "fmt"
)

//HerosNode 链表节点
type HerosNode struct {
    ID   int
    Name string
    pre  *HerosNode //指针
    next *HerosNode //指针
}

//InsertHerosNode 插入
func InsertHerosNode(head *HerosNode, newHerosNode *HerosNode) {
    tmp := head
    for {
        if tmp.next == nil {
            break
        }
        tmp = tmp.next
    }
    tmp.next = newHerosNode
    newHerosNode.pre = tmp
}

//InsertHerosNodeByID 根据id从小到大插入
func InsertHerosNodeByID(head *HerosNode, newHerosNode *HerosNode) {
    tmp := head

    for {
        if tmp.next == nil {
            tmp.next = newHerosNode
            newHerosNode.pre = tmp
            break
        }
        if tmp.next.ID > newHerosNode.ID {
            tmp.next.pre = newHerosNode
            newHerosNode.pre = tmp
            tmp2 := tmp.next
            tmp.next = newHerosNode
            newHerosNode.next = tmp2
            break
        } else if tmp.next.ID == newHerosNode.ID {
            fmt.Printf("已经存在id为%d的节点n", tmp.next.ID)
            break
        } else {
            tmp = tmp.next
        }
    }

}

//DeleteHerosNode 删除
func DeleteHerosNode(head *HerosNode, ID int) {
    tmp := head
    for {
        if tmp.next == nil {
            fmt.Println("链表中没有该id")
            break
        }
        if tmp.next.ID == ID {
            if tmp.next.next == nil {
                tmp.next = nil
            } else {
                tmp2 := tmp.next.next
                tmp.next = tmp2
                tmp2.pre = tmp
            }
            break
        } else {
            tmp = tmp.next
        }
    }
}

//FindHerosNode 查找
func FindHerosNode(head *HerosNode, ID int) {
    tmp := head
    for {
        if tmp.next == nil {
            fmt.Println("链表中没有该id")
            break
        }
        if tmp.next.ID == ID {
            fmt.Println("找到了该id")
            break
        } else {
            tmp = tmp.next
        }
    }
}

//ModifyHerosNode 修改
func ModifyHerosNode(head *HerosNode, ID int, changeName string) {
    tmp := head
    for {
        if tmp.next == nil {
            fmt.Println("链表中没有该id")
            break
        }
        if tmp.next.ID == ID {
            tmp.next.Name = changeName
            break
        } else {
            tmp = tmp.next
        }
    }
}

//ForListHerosNode 显示信息
func ForListHerosNode(forHead *HerosNode) {
    fmt.Println("正向打印所有信息")
    tmp := forHead
    if tmp.next == nil {
        fmt.Println("链表为空")
        return
    }
    for {
        fmt.Printf("节点信息如下：id=%d,name=%sn", tmp.next.ID, tmp.next.Name)
        tmp = tmp.next
        if tmp.next == nil {
            fmt.Println("已显示所有信息")
            break
        }
    }
}

//BackListHerosNode 显示信息
func BackListHerosNode(head *HerosNode) {
    fmt.Println("----------------------")
    fmt.Println("反向打印所有信息")
    tmp := head
    if tmp.next == nil {
        fmt.Println("链表为空")
        return
    }
    var backHead *HerosNode
    for {
        tmp = tmp.next
        if tmp.next == nil {
            backHead = tmp
            break
        }
    }
    for {
        fmt.Printf("节点信息如下：id=%d,name=%sn", backHead.ID, backHead.Name)
        backHead = backHead.pre
        if backHead.pre == head {
            fmt.Printf("节点信息如下：id=%d,name=%sn", backHead.ID, backHead.Name)
            fmt.Println("已显示所有信息")
            break
        }
    }
}

package main

import "go_code/data_structure/link"

func main() {

    head := &link.HerosNode{}
    hero1 := &link.HerosNode{
        ID:   1,
        Name: "宋江",
    }
    hero2 := &link.HerosNode{
        ID:   2,
        Name: "李逵",
    }
    hero4 := &link.HerosNode{
        ID:   4,
        Name: "林冲",
    }
    hero3 := &link.HerosNode{
        ID:   3,
        Name: "武松",
    }
    // link.InsertHerosNode(head, hero1)
    // link.InsertHerosNode(head, hero2)
    // link.InsertHerosNode(head, hero4)
    // link.InsertHerosNode(head, hero3)

    link.InsertHerosNodeByID(head, hero2)
    link.InsertHerosNodeByID(head, hero1)
    link.InsertHerosNodeByID(head, hero4)
    link.InsertHerosNodeByID(head, hero3)
    link.DeleteHerosNode(head, 3)
    link.FindHerosNode(head, 4)
    link.ModifyHerosNode(head, 4, "我是修改后的英雄")
    link.ForListHerosNode(head)
    link.BackListHerosNode(head)
}