题目链接:https://leetcode.com/problems/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.
# 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
"""
p,q=l1,l2
if(l1==None and l2 !=None): return l2
elif(l1!=None and l2==None): return l1
elif(l1==None and l2==None): return l1
cur=ListNode(0)
head=cur
while p and q:
if(p.val<=q.val):
head.next=p
p=p.next
else:
head.next=q
q=q.next
head=head.next
while p:
head.next=p
p=p.next
head=head.next
while q:
head.next=q
q=q.next
head=head.next
return cur.next