-
Notifications
You must be signed in to change notification settings - Fork 33
/
add-two-numbers(AC).cpp
61 lines (58 loc) · 1.09 KB
/
add-two-numbers(AC).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
56
57
58
59
60
61
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
/**
* @param l1: the first list
* @param l2: the second list
* @return: the sum list of l1 and l2
*/
ListNode *addLists(ListNode *l1, ListNode *l2) {
if (l1 == NULL) {
return l2;
}
if (l2 == NULL) {
return l1;
}
ListNode *h;
ListNode *t;
int c;
h = t = new ListNode(l1->val + l2->val);
c = t->val / 10;
t->val %= 10;
l1 = l1->next;
l2 = l2->next;
while (l1 != NULL && l2 != NULL) {
t->next = new ListNode(l1->val + l2->val + c);
t = t->next;
c = t->val / 10;
t->val %= 10;
l1 = l1->next;
l2 = l2->next;
}
while (l1 != NULL) {
t->next = new ListNode(l1->val + c);
t = t->next;
c = t->val / 10;
t->val %= 10;
l1 = l1->next;
}
while (l2 != NULL) {
t->next = new ListNode(l2->val + c);
t = t->next;
c = t->val / 10;
t->val %= 10;
l2 = l2->next;
}
if (c) {
t->next = new ListNode(1);
}
return h;
}
};