forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.cpp
More file actions
40 lines (36 loc) · 1001 Bytes
/
AddTwoNumbers.cpp
File metadata and controls
40 lines (36 loc) · 1001 Bytes
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
#include <iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
int add = 0;
ListNode *ret(NULL), *cur(NULL);
while (true) {
int s = add;
if (ret == NULL) {
s += l1->val + l2->val;
} else {
if (l1 != NULL) s += l1->val;
if (l2 != NULL) s += l2->val;
}
ListNode *t = new ListNode(s % 10);
add = s / 10;
if (ret == NULL) ret = t;
else cur->next = t;
cur = t;
if (l1 != NULL) l1 = l1->next;
if (l2 != NULL) l2 = l2->next;
if (l1 == NULL && l2 == NULL) break;
}
if (add == 1) {
ListNode *t = new ListNode(1);
cur->next = t;
}
return ret;
}
};