leetcode21. Merge Two Sorted Lists

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.

Subscribe to see which companies asked this question
思路：
因为是有序链表，所以很简单，比大小插入即可。

# 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):
        ans=ListNode(0)
        l=ans
        p=l1
        q=l2
        while p!=None and q!=None:
            if p.val<q.val:
                l.next=p
                p=p.next
                l=l.next
            else:
                l.next=q
                q=q.next
                l=l.next
        if p==None and q!=None:
            l.next=q
        if q==None and p!=None:
            l.next=p
        return ans.next