forked from int32bit/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsrc.cpp
78 lines (76 loc) · 1.28 KB
/
src.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <cstdio>
#include <cstdlib>
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) {
ListNode *p = l1, *q = l2, *result = NULL, *last;
int len1 = 0, len2 = 0;
while (p && q) {
len1++, len2++;
p = p->next;
q = q->next;
}
while(p) {
len1++;
p = p->next;
}
while (q) {
len2++;
q = q->next;
}
if (len1 >= len2) {
p = l1;
q = l2;
result = l1;
}
else {
p = l2;
q = l1;
result = l2;
}
bool carry = false;
while (p && q) {
p -> val = (p -> val + q -> val);
if (carry)
p -> val++;
if (p->val >= 10) {
p->val -= 10;
carry = true;
} else {
carry = false;
}
last = p;
p = p->next;
q = q->next;
}
while (p && carry) {
if (++(p->val) >= 10) {
p->val -= 10;
} else
carry = false;
last = p;
p = p->next;
}
if (carry)
last->next = new ListNode(1);
return result;
}
};
int main(int argc, char **argv)
{
Solution solution;
ListNode *l1 = new ListNode(5);
ListNode *l2 = new ListNode(5);
auto result = solution.addTwoNumbers(l1, l2);
while (result) {
printf("%d ", result->val);
result = result -> next;
}
return 0;
}