算法：合并两个有序数组

2020-12-13 09:02:46 编辑 1 阅读量:407

主要考察思维是否严谨，题目、代码如下：

```python
#Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if l1 is None:
            return l2
        if l2 is None:
            return l1
        l = ListNode(None)
        if l1.val > l2.val:
            l.val = l2.val
            l2 = l2.next
        else:
            l.val = l1.val
            l1 = l1.next
        current = l
        while l1 and l2:
            if l1.val > l2.val:
                current.next = ListNode(l2.val)
                l2 = l2.next
                current = current.next
            elif l1.val < l2.val:
                current.next = ListNode(l1.val)
                l1 = l1.next
                current = current.next
            else:
                current.next = ListNode(l1.val)
                current.next.next = ListNode(l2.val)
                l1 = l1.next
                l2 = l2.next
                current = current.next.next
        if l1:
            tmpl = l1
        else:
            tmpl = l2
        while tmpl:
            current.next = ListNode(tmpl.val)
            tmpl = tmpl.next
            current = current.next
        return l
```

算法：合并两个有序数组

附件: