力扣0718|链表

OctoberTE

已于 2023-07-19 22:03:16 修改

阅读量35

点赞数

分类专栏：力扣刷题文章标签： leetcode 链表算法

于 2023-07-19 07:58:27 首次发布

本文链接：https://blog.csdn.net/qq_43250021/article/details/131791769

版权

力扣刷题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

2.两数相加[中等题]

注意设置哨兵节点，以返回结果

class Solution:
    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
        cur = dummy = ListNode()
        remain = 0
        while(l1 or l2 or remain):
            remain += l1.val if l1 else 0
            remain += l2.val if l2 else 0
            cur.next = ListNode(val = remain%10) 
            cur = cur.next
            remain = remain//10
            l1 = l1.next if l1 else l1
            l2 = l2.next if l2 else l2
        return dummy.next

[445.两数相加Ⅱ][中等题]

思路一：遍历两个链表得到数字，然后创建链表。简单方法
思路二：反转链表➡两数相加➡反转链表

# 思路一
class Solution:
    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
        num1,num2 = 0,0
        while(l1):
            num1 = num1*10 + l1.val
            l1 = l1.next
        while(l2):
            num2 = num2*10 + l2.val
            l2 = l2.next
        num = num1+num2
        node = ListNode(val = num%10, next=None)
        num = num//10
        while(num):
            node = ListNode(val=num%10, next=node)
            num = num//10
        return node

#思路二
class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        def reverse(head):
            pre = None
            cur = head
            while(cur):
                temp = cur.next
                cur.next = pre
                pre = cur
                cur = temp
            return pre
        
        def addTwo (l1,l2):
            cur = dummy = ListNode()
            remine = 0
            while(l1 or l2 or remine):
                remine += l1.val if l1 else 0
                remine += l2.val if l2 else 0
                cur.next = ListNode(val = remine%10)
                remine = remine//10
                cur = cur.next
                l1 = l1.next if l1 else l1
                l2 = l2.next if l2 else l2
            return dummy.next

        l1 = reverse(l1)
        l2 = reverse(l2)
        res = addTwo(l1,l2)
        return reverse(res)

91.反转链表Ⅱ[中等题]

关键点：哨兵节点+部分翻转节点+缝接节点

class Solution:
    def reverseBetween(self, head: Optional[ListNode], left: int, right: int) -> Optional[ListNode]:
        dummy = ListNode(next=head)
        cur = dummy
        for i in range(left-1):
            cur = cur.next
        begin = cur                #保存翻转的前一个节点
        pre = None                 #反转链表
        cur = cur.next
        for i in range(right-left+1):
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp  
        #for循环结束后pre指向反转后的头节点，cur指向未反转的第一个节点
        begin.next = pre           #前节点拼接
        while(pre.next):
            pre = pre.next
        pre.next = cur             #后节点拼接
        return dummy.next