/
002Add Two Numbers.c
78 lines (66 loc) · 1.27 KB
/
002Add Two Numbers.c
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 <iostream>
#include <algorithm>
#include <string.h>
#include <vector>
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) {
if (l1 == NULL) return l2;
if (l2 == NULL) return l1;
int carry = 0;
ListNode *tail = new ListNode(0);
ListNode *ptr = tail;
while (l1 != NULL || l2 != NULL)
{
int val1 = 0;
if (l1 != NULL)
{
val1 = l1->val;
l1 = l1->next;
}
int val2 = 0;
if (l2 != NULL)
{
val2 = l2->val;
l2 = l2->next;
}
int count = val1 + val2 + carry;
ptr->next = new ListNode(count % 10);
carry = count / 10;
ptr = ptr->next;
}
if (carry == 1)
{
ptr->next = new ListNode(1);
}
return tail->next;
}
};
int main()
{
ListNode *p1 = new ListNode(2);
ListNode *p3 = p1;
p1->next = new ListNode(4);
p1 = p1->next;
p1->next = new ListNode(3);
ListNode *p2 = new ListNode(2);
ListNode *p4 = p2;
p2->next = new ListNode(4);
p2 = p2->next;
p2->next = new ListNode(3);
Solution c;
ListNode *tmp = c.addTwoNumbers(p3,p4);
while (tmp != NULL)
{
cout << tmp->val;
tmp = tmp->next;
cout << " ";
}
system("pause");
}