-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2. Add Two Numbers.cpp
44 lines (38 loc) · 1.02 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
/**
* 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* pRes = new ListNode(0);
ListNode* pNow = pRes;
int pp = false;
while (l1 != NULL || l2 != NULL) {
int sum = 0;
if (l1 != NULL) {
sum += l1->val;
}
if (l2 != NULL) {
sum += l2->val;
}
sum += pp;
pNow->val = sum % 10;
pp = sum / 10;
// update.
if (l1 != NULL)
l1 = l1->next;
if (l2 != NULL)
l2 = l2->next;
if ((l1 != NULL) || (l2 != NULL) || pp) {
pNow->next = new ListNode(pp);
pNow = pNow->next;
}
}
return pRes;
}
};