-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2.py
More file actions
95 lines (71 loc) · 1.93 KB
/
2.py
File metadata and controls
95 lines (71 loc) · 1.93 KB
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
'''
2. Add Two Numbers
You are given two linked lists representing two non-negative
numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
'''
from ListNode import *
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if not l1 or not l2:
return l1 or l2
cur = self
carry = 0
while l1 or l2 or carry:
if l1:
carry = l1.val + carry
l1 = l1.next
if l2:
carry = l2.val + carry
l2 = l2.next
cur.next = ListNode(carry % 10)
cur = cur.next
carry //= 10
return self.next
def addTwoNumbers_in_order_result(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if not l1 or not l2:
return l1 or l2
cur = self
carry = 0
pre = None
while l1 or l2 or carry:
if l1:
carry = carry + l1.val
l1 = l1.next
if l2:
carry = carry + l2.val
l2 = l2.next
temp = ListNode(carry % 10)
temp.next = pre
cur.next = temp
pre = temp
carry = carry // 10
return cur
def test():
l1 = [1, 2, 3]
l2 = [0, 9, 1]
headA = List_to_Link(l1).head
headB = List_to_Link(l2).head
sol = Solution()
headC = sol.addTwoNumbers(headA, headB)
Link_to_List(headC).print_list()
if __name__ == "__main__":
test()