LeetCode021 Merge Two Sorted Lists

最新推荐文章于 2024-07-06 19:08:33 发布

船桥

最新推荐文章于 2024-07-06 19:08:33 发布

阅读量534

点赞数

分类专栏： LeetCode Python

本文链接：https://blog.csdn.net/AIpush/article/details/79954474

版权

LeetCode 同时被 2 个专栏收录

179 篇文章 0 订阅

订阅专栏

Python

173 篇文章 0 订阅

订阅专栏

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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

想到了用递归的方法做这道题。先比较l1和l2第一个节点的val，如果l1节点的val小，则输出这个节点，并继续比较l1.next和l2，

以此类推。

代码：

# 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 not l1:
            return l2
        elif not l2:
            return l1
        else:
            if l1.val <= l2.val:
                l1.next = self.mergeTwoLists(l1.next,l2)
                return l1
            else:
                l2.next = self.mergeTwoLists(l1,l2.next)
                return l2

或者按照常规思路，用两个指针

# 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
        """
        head=p=ListNode(0)
        while l1 and l2:
            if l1.val<=l2.val:
                p.next = l1
                p = p.next
                l1 = l1.next
            else:
                p.next = l2
                p = p.next
                l2 = l2.next
        if l1:
            p.next = l1
        if l2:
            p.next = l2
            
        return head.next