python写算法题：leetcode: 21. Merge Two Sorted Lists

最新推荐文章于 2021-11-27 11:31:42 发布

激荡数十年

最新推荐文章于 2021-11-27 11:31:42 发布

阅读量665

点赞数

分类专栏：算法 python

本文链接：https://blog.youkuaiyun.com/lzf_china/article/details/73164966

版权

算法同时被 2 个专栏收录

158 篇文章

订阅专栏

python

115 篇文章

订阅专栏

https://leetcode.com/problems/merge-two-sorted-lists/#/description

# 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==None: return l2
        if l2==None: return l1
        
        head=None
        if l1.val<l2.val:
            head=l1
            l1=l1.next
        else:
            head=l2
            l2=l2.next
        mlist=head
        while l1!=None and l2!=None:
            if l1.val<l2.val:
                mlist.next=l1
                l1=l1.next
            else:
                mlist.next=l2
                l2=l2.next
            mlist=mlist.next
        if l1==None:
            mlist.next=l2
        else:
            mlist.next=l1
        return head