1. package link_list
    3. import "fmt"
    5. type DoubleLinkNode struct {
    6.     Value interface{}
    7.     Prev  *DoubleLinkNode
    8.     Next  *DoubleLinkNode
    9. }
    11. type DoubleLinkList struct {
    12.     DoubleLinkNode *DoubleLinkNode
    13.     Length         int
    14. }
    16. func NewDoubleLinkNode() *DoubleLinkNode { return &DoubleLinkNode{Value: 0, Prev: nil, Next: nil} }
    18. func (d *DoubleLinkNode) GetValue() interface{} { return d.Value }
    20. func (d *DoubleLinkNode) GetPrevNode() *DoubleLinkNode { return d.Prev }
    22. func (d *DoubleLinkNode) GetNextNode() *DoubleLinkNode { return d.Next }
    24. func NewDoubleLinkList() *DoubleLinkList {
    25.     return &DoubleLinkList{DoubleLinkNode: NewDoubleLinkNode(), Length: 0}
    26. }
    28. // 双链表插入到后面
    29. func (d *DoubleLinkList) InsertAfterNode(node *DoubleLinkNode, value interface{}) bool {
    30.     if node == nil {
    31.         return false
    32.     }
    34.     newNode := NewDoubleLinkNode()
    35.     newNode.Value = value
    36.     newNode.Prev = node
    37.     node.Next = newNode
    38.     return true
    39. }
    41. // 双链表插入到前面
    42. func (d *DoubleLinkList) InsertBeforeNode(node *DoubleLinkNode, value interface{}) bool {
    43.     if node == nil {
    44.         return false
    45.     }
    47.     newNode := NewDoubleLinkNode()
    48.     newNode.Value = value
    49.     newNode.Prev = node.Prev
    50.     newNode.Next = node
    51.     node.Prev.Next = newNode
    52.     return true
    53. }
    55. func (d *DoubleLinkList) Print() {
    56.     if d.DoubleLinkNode.Next == nil {
    57.         return
    58.     }
    60.     cur := d.DoubleLinkNode.Next
    61.     format := ""
    62.     for nil != cur {
    63.         format += fmt.Sprintf("%+v->", cur.Value)
    64.         cur = cur.Next
    65.     }
    67.     fmt.Println(format)
    68. }