-
Notifications
You must be signed in to change notification settings - Fork 95
/
Copy pathadd-two-numbers.cpp
44 lines (44 loc) · 1.06 KB
/
add-two-numbers.cpp
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
/**
* 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) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int add = 0;
ListNode **p = &l1;
while(*p && l2) {
(*p)->val += add + l2->val;
if((*p)->val > 9) {
add = 1;
(*p)->val -= 10;
} else
add = 0;
p = &((*p)->next);
l2 = l2->next;
}
if(l2) {
*p = l2;
}
while(*p && add) {
(*p)->val += add;
if((*p)->val > 9) {
(*p)->val -= 10;
} else {
add = 0;
break;
}
p = &((*p)->next);
}
if(add) {
*p = new ListNode(add);
}
return l1;
}
};