forked from iphkwan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Add_Two_Numbers.cc
41 lines (41 loc) · 1.18 KB
/
Add_Two_Numbers.cc
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
/**
* 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 *ret = NULL;
ListNode **pCur = &ret;
int nxt = 0;
while (l1 && l2) {
*pCur = new ListNode((l1->val + l2->val + nxt) % 10);
nxt = (l1->val + l2->val + nxt) / 10;
pCur = &((*pCur)->next);
l1 = l1->next;
l2 = l2->next;
}
while (l1 != NULL) {
*pCur = new ListNode((l1->val + nxt) % 10);
nxt = (l1->val + nxt) / 10;
pCur = &((*pCur)->next);
l1 = l1->next;
}
while (l2 != NULL) {
*pCur = new ListNode((l2->val + nxt) % 10);
nxt = (l2->val + nxt) / 10;
pCur = &((*pCur)->next);
l2 = l2->next;
}
if (nxt > 0) {
*pCur = new ListNode(nxt);
}
return ret;
}
};