【python】【 Add Two Numbers】6/18/2020

2.Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

因为看题都不怎么会于是打开了算法导论复习一个linked list的知识。
书上是这样讲的：
链表其中的各个对象按线性顺序排列。链表的顺序是由各个对象里的指针决定的。如果链表是单向的，(single linked)，则省略每个元素中的prev指针。

首先我先不考虑进位问题，我可以构建一个新的指针去保存我的加法结束后的值。

head = ListNode(None)
p = head
add = l1.val+l2.val

确保第一项加出来的值是我想要的，也就是2➕5等于7.
然后通过loop将每一项都相加。

head = ListNode(None)
p = head
while l1 and l2:
	add = l1.val+l2.val
	l1 = l1.next
	l2 = l2.next
	p.next = ListNode(add)
	p = p.next
return head.next

这样我就可以得到一个简单版本的相加答案

input:[2,4,3]
	  [5,1,4]
output:[7,5,7]

这个时候开始考虑进位的问题，当4与6相加时，需往后一位➕1，

head = ListNode(None)
p = head
carry = 0
while l1 and l2:
	add = l1.val+l2.val+carry
	if add >=10:
		carry = 1
	l1 = l1.next
	l2 = l2.next
	p.next = ListNode(add % 10)
	p = p.next
return head.next

这样，进位后得到的是理想的结果，可以得到；

input:[2,4,3]
	  [5,6,4]
output:[7,0,8]

这时考虑两个链表长度不相同的情况以及最后一位相加又大于10的情况：

head = ListNode(None)
p = head
carry = 0
while l1 and l2:
	add = l1.val+l2.val+carry
	if add >=10:
		carry = 1
		p.next = ListNode(add - 10)
	else:
        carry = 0
        p.next = ListNode(add)
	p = p.next
	l1 = l1.next
	l2 = l2.next
if l1:
	l = l1
l = l2
while l:
	add = l.val +carry
	if add >=10:
		carry = 1
		p.next = ListNode(add - 10)
	else:
        carry = 0
        p.next = ListNode(add)
	p = p.next
	l = l.next
if carry:
	p.next = ListNode(1)
return head.next

时间复杂度是O(n)
空间复杂度是O(n)

参考：
https://blog.csdn.net/fuxuemingzhu/article/details/79379626