forked from kedebug/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.cpp
More file actions
61 lines (54 loc) · 1.46 KB
/
AddTwoNumbers.cpp
File metadata and controls
61 lines (54 loc) · 1.46 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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int carry = 0;
ListNode *list = new ListNode(0);
ListNode *head = list;
ListNode *prev = list;
while (l1 && l2) {
carry += l1->val + l2->val;
list = new ListNode(0);
list->val = carry % 10;
carry /= 10;
l1 = l1->next;
l2 = l2->next;
prev->next = list;
prev = prev->next;
}
while (l1) {
carry += l1->val;
list = new ListNode(0);
list->val = carry % 10;
carry /= 10;
l1 = l1->next;
prev->next = list;
prev = prev->next;
}
while (l2) {
carry += l2->val;
list = new ListNode(0);
list->val = carry % 10;
carry /= 10;
l2 = l2->next;
prev->next = list;
prev = prev->next;
}
if (carry) {
list = new ListNode(0);
list->val = carry;
prev->next = list;
prev = prev->next;
}
return head->next;
}
};