forked from randlezhang/Leetcode-codewar-practice
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathaddTwonumbers.cpp
42 lines (41 loc) · 1.12 KB
/
addTwonumbers.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
/**
* 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) {
ListNode* res = l1;
ListNode* free = l2;
int adding = 0;
while ( l2 && l1 )
{
l1->val += l2->val+adding;
adding = l1->val/10;
l1->val = l1->val%10;
if ((l1->next == nullptr)||(l2->next == nullptr)){
if(l1->next==nullptr) l1->next = l2->next;
while (adding) {
if(l1->next){
l1 = l1->next;
l1->val += adding;
adding = l1->val/10;
l1->val = l1->val%10;
continue;
}
l1->next = new ListNode(adding);
adding = 0;
}
delete free;
return res;
}
l1 = l1->next;
l2 = l2->next;
}
return res;
}
};