LeetCode 88. 合并两个有序数组 golang

LeetCode 21. 合并两个有序链表 golang

合并两个有序链表并去重

/*** Definition for singly-linked list.* type ListNode struct {*     Val int*     Next *ListNode* }*/
func mergeTwoLists(list1 *ListNode, list2 *ListNode) *ListNode {if list1 == nil {return list2}if list2 == nil {return list1}if list1.Val < list2.Val {list1.Next = mergeTwoLists(list1.Next, list2)return list1} else {if list1.Val == list2.Val {list2.Next = mergeTwoLists(list1.Next, list2.Next)} else {list2.Next = mergeTwoLists(list1, list2.Next)}return list2}
}