-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.py
43 lines (42 loc) · 1018 Bytes
/
2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if not l1:
return l2
res = l1
label = 0
pre = l1
while l1 and l2:
l1.val = l1.val + l2.val + label
if l1.val >= 10:
l1.val -= 10
label = 1
else:
label = 0
pre = l1
l1 = l1.next
l2 = l2.next
if l2:
pre.next = l2
l1 = l2
while l1:
l1.val = l1.val + label
if l1.val >= 10:
l1.val -= 10
label = 1
else:
label = 0
pre = l1
l1 = l1.next
if label == 1:
pre.next = ListNode(1)
return res