-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2_Add Two Numbers.cpp
55 lines (45 loc) · 1.32 KB
/
2_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
45
46
47
48
49
50
51
52
53
54
55
/**
* 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) {
if ( l1 == NULL )
return l2;
else if ( l2 == NULL )
return l1;
else if ( l1 == NULL && l2 == NULL )
return l1;
int sum = 0, carry = 0;
ListNode* ans = new ListNode(0);
ListNode* tmp = ans;
while ( l1 != NULL || l2 != NULL || carry ) {
sum = 0;
if ( l1 && l2 )
sum = l1->val + l2->val + carry;
else if ( !l1 && l2 )
sum = l2->val + carry;
else if ( l1 && !l2 )
sum = l1->val + carry;
else if ( !l1 && !l2 )
sum = carry;
carry = 0;
if ( sum >= 10 ) {
carry = sum / 10;
sum %= 10;
}
tmp->next = new ListNode(sum);
tmp = tmp -> next;
if ( l1 != NULL )
l1 = l1->next;
if ( l2 != NULL )
l2 = l2->next;
}
return ans->next;
}
};