-
Notifications
You must be signed in to change notification settings - Fork 0
/
2. Add Two Numbers.cpp
67 lines (66 loc) · 1.93 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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/**
* 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) {
int flag = 0x00;
ListNode *node = l1, *node2 = l2, *prev = l1;
while (NULL != node && NULL != node2) {
int value = node->val + node2->val + flag;
if (value >= 10) {
flag = 0x01;
node->val = value - 10;
} else {
flag = 0x00;
node->val = value;
}
prev = node;
node = node->next;
node2 = node2->next;
}
if (NULL == node) {
while (NULL != node2) {
if (flag == 0x01) {
int value = node2->val + flag;
if (value >= 10) {
flag = 0x01;
value = value - 10;
} else {
flag = 0x00;
}
node2->val = value;
}
prev->next = node2;
prev = node2;
node2 = node2->next;
}
}
if (NULL == node2) {
while (NULL != node) {
if (flag == 0x01) {
int value = node->val + flag;
if (value >= 10) {
flag = 0x01;
value = value - 10;
} else {
flag = 0x00;
}
node->val = value;
}
prev = node;
node = node->next;
}
}
if (flag == 0x01) {
ListNode *p = new ListNode(1);
prev->next = p; #需要做delete在~Solution()
}
return l1;
}
};