Golang指针链表实现教程

type ListNode struct {
    Val  int
    Next *ListNode
}

func appendNode(head *ListNode, val int) *ListNode {
    newNode := &ListNode{Val: val, Next: nil}
    if head == nil {
        return newNode
    }
    current := head
    for current.Next != nil {
        current = current.Next
    }
    current.Next = newNode
    return head
}

func printList(head *ListNode) {
    current := head
    for current != nil {
        fmt.Printf("%d -> ", current.Val)
        current = current.Next
    }
    fmt.Println("nil")
}

func deleteNode(head *ListNode, val int) *ListNode {
    if head == nil {
        return nil
    }
    if head.Val == val {
        return head.Next
    }
    current := head
    for current.Next != nil && current.Next.Val != val {
        current = current.Next
    }
    if current.Next != nil {
        current.Next = current.Next.Next
    }
    return head
}