文巾解题 21. 合并两个有序链表

最新推荐文章于 2024-02-01 15:59:38 发布

UQI-LIUWJ

最新推荐文章于 2024-02-01 15:59:38 发布

阅读量94

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/qq_40206371/article/details/117853635

版权

leetcode 专栏收录该内容

131 篇文章 0 订阅

订阅专栏

1 题目描述

2 解题思路

2.1 哨兵节点+循环

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        tmp=ListNode(0)#哨兵节点
        ret=tmp

        while(l1!=None and l2!=None):
#如果l1和l2都有值得情况下
            if(l1.val<=l2.val):
                tmp.next=ListNode(l1.val)
                tmp=tmp.next
                l1=l1.next
            else:
                tmp.next=ListNode(l2.val)
                tmp=tmp.next
                l2=l2.next
        if(l1!=None):
            tmp.next=l1
        if(l2!=None):
            tmp.next=l2
#如果l1和l2还有一个有值


        return(ret.next)

2.2 迭代

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        if(l1==None and l2==None):
            return None
        elif(l2==None):
            return l1
        elif(l1==None):
            return l2
        elif(l1.val>=l2.val):
            tmp=ListNode(l2.val)
            tmp.next=self.mergeTwoLists(l1,l2.next)
            return tmp
        else:
            tmp=ListNode(l1.val)
            tmp.next=self.mergeTwoLists(l1.next,l2)
            return tmp