golang 21合并两个有序链表

Posted 2021-05-24

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
    l3 := new(ListNode)
	cur := l3
	for l1 != nil || l2 != nil {
		node := new(ListNode)
		if l1 == nil {
			node.Val = l2.Val
			l2 = l2.Next
			cur.Next = node
			cur = node
			continue
		}
		if l2 == nil {
			node.Val = l1.Val
			l1 = l1.Next
			cur.Next = node
			cur = node
			continue
		}

		if l1.Val < l2.Val {
			node.Val = l1.Val
			l1 = l1.Next
		} else {
			node.Val = l2.Val
			l2 = l2.Next
		}
		cur.Next = node
		cur = node
	}
	return l3.Next
    
}

golang各版本的变化

https://golang.org/doc/
https://golang.org/doc/go1.6
https://golang.org/doc/go1.5
https://golang.org/doc/go1.4
https://golang.org/doc/go1.3
https://golang.org/doc/go1.2
https://golang.org/doc/go1.1