-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd-two-numbers.cpp
More file actions
102 lines (87 loc) · 1.95 KB
/
add-two-numbers.cpp
File metadata and controls
102 lines (87 loc) · 1.95 KB
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#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)
{
ListNode *ret = NULL;
ListNode *last = ret;
int inc = 0;
// 2. 用错关系符
while (l1 != NULL || l2 != NULL)
{
int l = 0;
if (l1 != NULL)
{
l = l1->val;
l1 = l1->next;
}
int r = 0;
if (l2 != NULL)
{
r = l2->val;
l2 = l2->next;
}
int sum = l + r + inc;
int v = sum % 10;
inc = sum / 10;
if (last == NULL)
{
ret = new ListNode(v);
last = ret;
}
else
{
last->next = new ListNode(v);
last = last->next;
}
}
while (inc > 0)
{
// 1. 低级错误, 弄反两个运算符, 导致死循环
int v = inc % 10;
inc = inc / 10;
last->next = new ListNode(v);
last = last->next;
}
return ret;
}
};
int main()
{
ListNode *a = new ListNode(5);
ListNode *b = new ListNode(5);
// a->next = new ListNode(4);
// a->next->next = new ListNode(3);
// b->next = new ListNode(6);
// b->next->next = new ListNode(4);
ListNode *next = a;
while (next != NULL)
{
cout << next->val << "->";
next = next->next;
}
cout << endl;
next = b;
while (next != NULL)
{
cout << next->val << "->";
next = next->next;
}
cout << endl;
next = (new Solution())->addTwoNumbers(a, b);
while (next != NULL)
{
cout << next->val << "->";
next = next->next;
}
cout << endl;
return 0;
}