题目

解法1、

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = Noneclass Solution:def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:curr = dummy = ListNode(0)while l1 and l2:if l1.val < l2.val:curr.next = l1l1 = l1.nextelse:curr.next = l2l2 = l2.nextcurr = curr.nextcurr.next = l1 or l2return dummy.next
if __name__ == "__main__":l1 = ListNode(1)l1.next = ListNode(2)l1.next.next = ListNode(4)l2 = ListNode(1)l2.next = ListNode(3)l2.next.next = ListNode(4)r = Solution().mergeTwoLists(l1, l2)while r:print(r.val)r = r.next

1、两个变量指向新链表，curr用来更新链表

解法2、

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = Noneclass Solution:def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:if l1 and l2:if l1.val > l2.val: l1, l2 = l2, l1l1.next = self.mergeTwoLists(l1.next, l2)return l1 or l2

出处

1、https://www.bilibili.com/video/av45843264
2、对应题目下Knife丶的题解

文章已搬运至个人博客：https://night-zhang.github.io/

LeetCode in Python-21. Merge Two Sorted Lists 合并两个有序链表相关推荐

【LeetCode】Merge Two Sorted Lists(合并两个有序链表)
这道题是LeetCode里的第21道题. 题目描述: 将两个有序链表合并为一个新的有序链表并返回.新链表是通过拼接给定的两个链表的所有节点组成的. 示例: 输入:1->2->4, 1-&g ...
[LeetCode] Merge k Sorted Lists 合并k个有序链表
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. E ...
合并k个有序链表 python_[LeetCode] 23. Merge k Sorted Lists 合并k个有序链表
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. E ...
LeetCode刷题记录15——21. Merge Two Sorted Lists（easy）
LeetCode刷题记录15--21. Merge Two Sorted Lists(easy) 目录 LeetCode刷题记录15--21. Merge Two Sorted Lists(easy) ...
Leetcode 21:Merge Two Sorted Lists（golang实现合并两条已经排序的链表）
21.Merge Two Sorted Lists 题目链接:题目链接 Merge two sorted linked lists and return it as a new list. The n ...
21.Merge Two Sorted Lists 、23. Merge k Sorted Lists
21.Merge Two Sorted Lists 初始化一个指针作为开头,然后返回这个指针的next class Solution { public:ListNode* mergeTwoLists( ...
LeetCode 21.23.剑指 Offer II 078. 合并两个有序链表 | C语言版
LeetCode 21. 合并两个有序链表 | C语言版 LeetCode 21. 合并两个有序链表题目描述解题思路思路一:使用栈代码实现运行结果参考文章: 思路二:减少遍历节点数代码实 ...
《LeetCode力扣练习》第21题合并两个有序链表 Java
<LeetCode力扣练习>第21题合并两个有序链表 Java 一.资源题目: 将两个升序链表合并为一个新的升序链表并返回.新链表是通过拼接给定的两个链表的所有节点组成的. 示例 ...
【LeetCode】【HOT】21. 合并两个有序链表（递归）
[LeetCode][HOT 100]21. 合并两个有序链表文章目录 [LeetCode][HOT 100]21. 合并两个有序链表 package hot;import java.util.Ar ...

LeetCode in Python-21. Merge Two Sorted Lists 合并两个有序链表

Merge Two Sorted Lists 合并两个有序链表

题目

解法1、

解法2、

出处

LeetCode in Python-21. Merge Two Sorted Lists 合并两个有序链表相关推荐

最新文章

热门文章