-
Notifications
You must be signed in to change notification settings - Fork 0
/
my_002_Add Two Numbers.cpp
84 lines (84 loc) · 2.05 KB
/
my_002_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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
/**
* 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) {
if (!l1)
return l2;
if (!l2)
return l1;
int sum = l1->val+l2->val;
int temp = 0;
ListNode* root = new ListNode(0);
if (sum > 9){
root->val = sum%10;
temp = 1;
}
else
root->val = sum;
ListNode* p = root;
l1 = l1->next;
l2 = l2->next;
while (l1 && l2) {
sum = l1->val+l2->val;
sum += temp;
ListNode* cur = new ListNode(0);
if (sum > 9){
cur->val = sum%10;
temp = 1;
}
else{
cur->val = sum;
temp = 0;}
p->next = cur;
p = cur;
l1 = l1->next;
l2 = l2->next;
}
while (l2 && temp == 1){
sum = l2->val;
sum += temp;
ListNode* cur = new ListNode(0);
if (sum > 9){
cur->val = sum%10;
temp = 1;
}
else{
cur->val = sum;
temp = 0;}
p->next = cur;
p = cur;
l2 = l2->next;
}
while (l1 && temp == 1){
sum = l1->val;
sum += temp;
ListNode* cur = new ListNode(0);
if (sum > 9){
cur->val = sum%10;
temp = 1;
}
else{
cur->val = sum;
temp = 0;}
p->next = cur;
p = cur;
l1 = l1->next;
}
if (l1 && temp == 0)
p->next = l1;
if (l2 && temp == 0)
p->next = l2;
if (!l1 && !l2 && temp == 1){
ListNode* cur = new ListNode(1);
p->next = cur;
}
return root;
}
};