-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path002. Add Two Numbers
57 lines (49 loc) · 1.28 KB
/
002. 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
49
50
51
52
53
54
55
56
57
//C++ solution:
/**
* 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;}
if (l2==NULL) {return l1;}
ListNode* res = NULL;
ListNode* result = NULL;
int value = 0;
int carry = 0;
while(l1 != NULL || l2 != NULL) {
value = carry;
if(l1 != NULL) {
value = value + l1->val;
}
if(l2 != NULL){
value = value + l2->val;
}
carry = value / 10;
value = value - carry * 10;
if(res == NULL){
res = new ListNode(value);
result = res;
}
else{
res->next = new ListNode(value);
res = res->next;
}
if(l1 != NULL){
l1 = l1->next;
}
if(l2 != NULL){
l2 = l2->next;
}
}
if(carry != 0){
res->next = new ListNode(carry);
}
return result;
}
};