File tree Expand file tree Collapse file tree 1 file changed +38
-0
lines changed Expand file tree Collapse file tree 1 file changed +38
-0
lines changed Original file line number Diff line number Diff line change
1
+ '''
2
+ 给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
3
+ 如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
4
+ 您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
5
+ 示例:
6
+ 输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
7
+ 输出:7 -> 0 -> 8
8
+ 原因:342 + 465 = 807
9
+ '''
10
+ # Definition for singly-linked list.
11
+ class ListNode :
12
+ def __init__ (self , x ):
13
+ self .val = x
14
+ self .next = None
15
+
16
+ class Solution :
17
+ def addTwoNumbers (self ,l1 :ListNode ,l2 :ListNode )-> ListNode :
18
+ l3 = l4 = ListNode (0 )
19
+ add = 0
20
+ while l1 or l2 :
21
+ val1 = l1 .val if l1 else 0
22
+ val2 = l2 .val if l2 else 0
23
+ num = val1 + val2 + add
24
+ add = 0
25
+ if num >= 10 :
26
+ num = num % 10
27
+ add = 1
28
+ l3 .next = ListNode (num )
29
+ l1 = l1 .next if l1 else l1
30
+ l2 = l2 .next if l2 else l2
31
+ l3 = l3 .next
32
+ if add :
33
+ l3 .next = ListNode (1 )
34
+
35
+ return l4 .next
36
+
37
+
38
+
You can’t perform that action at this time.
0 commit comments