# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
def dfs(l1, l2, i):
# 设置递归结束条件
if not l1 and not l2 and not i:
return None
# 将三个链表所在位相加
add = (l1.val if l1 else 0) + (l2.val if l2 else 0) + i
# 得到两数相加之和 取余后存入新的链表
node = ListNode(add % 10)
# 递归得到后续的node
node.next = dfs(l1.next if l1 else None, l2.next if l2 else None, add // 10)
return node
return dfs(l1, l2, 0)
一开始看到这道题有点看不太懂,后来翻了一下题解,明白了其实就是求两个反转的数字的和,也就是说我从前往后相加,碰到10以上的就进1,最后将这个数存到链表里返回就可以了
循环实现的逻辑和递归一致,所以就只用了递归实现
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
# reverse_head = None
# current = head
# while current:
# reverse_head, reverse_head.next, current = current, reverse_head, current.next
# return reverse_head
def reverse_current(current, pre):
if current == None:
return pre
result = reverse_current(current.next, current)
current.next = pre
return result
return reverse_current(head, None)
反转链表的话有两种方法,一种就是遍历整个链表,将第一个链表指向None,然后第二个指向第一个,第三个指向第二个... 直至遍历完整个链表
第二种方法就是遍历这个链表,然后从最后一个指向上一个,循环如此,最后得到反转