-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdd Two Numbers
48 lines (43 loc) · 1.08 KB
/
Add Two Numbers
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
/**
* 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
//ListNode *res = l1;
int c = 0;
ListNode *back, *res=l1;
while (l1!=NULL && l2!=NULL)
{
int tmp = l1->val+l2->val+c;
l1->val = tmp%10;
c = tmp/10;
l2 = l2->next;
back = l1;
l1 = l1->next;
}
ListNode *contin = (l2==NULL)?l1:l2;
back->next = contin;
while (contin)
{
int tmp = contin->val+c;
contin->val = tmp%10;
c = tmp/10;
back = contin;
contin = contin->next;
}
if(c)
{
ListNode *high = new ListNode(c);
back->next = high;
}
return res;
}
};