a = [] b = [] while l1 or l2: if l1: a.append(l1.val) l1 = l1.next if l2: b.append(l2.val) l2 = l2.next
然后写个条件循环
出栈并处理进位添加节点
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
m = n = ListNode(0) while a or b: if a: k = a.pop() else: k = 0 if b: v = b.pop() else: v = 0 s = (k+v+c) c = s // 10 m.next = ListNode(s % 10) m = m.next
补位 (如果遍历完了 还有进位 则需补位)
1 2
if c: m.next = ListNode(c)
再写个反转链表的函数
1 2 3 4 5 6 7 8 9
classSolution: defreverseList(self, head: ListNode) -> ListNode: prev, curr = None, head while curr isnotNone: next = curr.next curr.next = prev prev = curr curr = next return prev
classSolution: defreverseList(self, head: ListNode) -> ListNode: prev, curr = None, head while curr isnotNone: next = curr.next curr.next = prev prev = curr curr = next return prev
defaddTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]: a = [] b = [] c = 0 m = n = ListNode(0) k = 0 v = 0 while l1 or l2: if l1: a.append(l1.val) l1 = l1.next if l2: b.append(l2.val) l2 = l2.next while a or b: if a: k = a.pop() else: k = 0 if b: v = b.pop() else: v = 0 s = (k+v+c) c = s // 10 m.next = ListNode(s % 10) m = m.next if c: m.next = ListNode(c) return self.reverseList(n.next)
## 时间复杂度: O(max(n,m)) ## 空间复杂度: O(m+n) classSolution: defreverseList(self, head: ListNode) -> ListNode: prev, curr = None, head while curr isnotNone: next = curr.next curr.next = prev prev = curr curr = next return prev
defaddTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]: a = [] b = [] c = 0 m = n = ListNode(0) k = 0 v = 0 while l1 or l2: if l1: a.append(l1.val) l1 = l1.next if l2: b.append(l2.val) l2 = l2.next while a or b: if a: k = a.pop() else: k = 0 if b: v = b.pop() else: v = 0 s = (k+v+c) c = s // 10 m.next = ListNode(s % 10) m = m.next if c: m.next = ListNode(c) return self.reverseList(n.next)