-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path4_AddTwoNumber.cpp
More file actions
152 lines (139 loc) · 2.2 KB
/
Copy path4_AddTwoNumber.cpp
File metadata and controls
152 lines (139 loc) · 2.2 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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include <iostream>
#include <cassert>
using namespace std;
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
int carry = 0;
int tmp = l1->val + l2->val;
if (tmp > 9)
{
carry = 1;
tmp = tmp%10;
}
ListNode *l3 = new ListNode(tmp);
ListNode *head = l3;
while (l1->next != NULL && l2->next != NULL)
{
l1 = l1->next;
l2 = l2->next;
tmp = l1->val+l2->val+carry;
if (tmp > 9)
{
tmp = tmp % 10;
carry = 1;
}
else
{
carry = 0;
}
ListNode *tmp_node = new ListNode(tmp);
l3->next = tmp_node;
l3 = l3->next;
}
if(l1->next != NULL)
{
assert(l2->next == NULL);
l1 = l1->next;
l3->next = l1;
while (l3->next != NULL && carry == 1)
{
l3 = l3->next;
l3->val = l3->val + carry;
if (l3->val == 10)
{
l3->val = 0;
carry = 1;
}
else
{
carry = 0;
}
}
}
if (l2->next != NULL)
{
assert(l1->next == NULL);
l2 = l2->next;
l3->next = l2;
while (l3->next != NULL && carry == 1)
{
l3 = l3->next;
l3->val = l3->val + carry;
if (l3->val == 10)
{
l3->val = 0;
carry = 1;
}
else
{
carry = 0;
}
}
}
if (carry == 1)
{
l3->next = new ListNode(1);
}
return head;
}
};
ListNode* genereateList(int num)
{
ListNode *p = new ListNode(num%10);
ListNode *head = p;
num = num/10;
while(num)
{
p->next = new ListNode(num%10);
num = num/10;
p = p->next;
}
return head;
}
void printList(ListNode *p)
{
while (p)
{
cout << p->val ;
p = p->next;
}
cout << endl;
}
ListNode* reverseList(ListNode *p)
{
if(p->next != NULL)
{
reverseList(p->next)->next = p;
ListNode* tmp = p;
p = p->next;
return tmp;
}
}
/*
int main()
{
ListNode *l1 = genereateList(999);
ListNode *l2 = genereateList(1);
printList(l1);
printList(l2);
Solution sln;
ListNode *result = sln.addTwoNumbers(l1,l2);
printList(result);
system("PAUSE");
return 0;
}
*/