forked from PawanJaiswal08/leetcode-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
2.add-two-numbers.cpp
139 lines (114 loc) · 3 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
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
// 2. Add Two Numbers
#include<bits/stdc++.h>
using namespace std;
class ListNode {
public:
int data;
ListNode* next;
public:
ListNode(int data){
this->data = data;
this->next = NULL;
}
};
void insertAtTail(ListNode* &tail, int data){
ListNode* temp = new ListNode(data);
tail->next = temp;
tail = tail->next;
}
void print(ListNode* &head){
ListNode* temp = head;
while(temp != NULL){
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
ListNode* addTwoNumbers(ListNode* head1, ListNode* head2) {
ListNode* dummy = new ListNode(-1);
ListNode* temp = dummy;
// int sum = 0;
int carry = 0;
while(head1 != NULL && head2 != NULL){
int sum = head1->data + head2->data + carry;
if(sum >= 10){
carry = 1;
sum = sum - 10;
ListNode* nextNode = new ListNode(sum);
temp->next = nextNode;
temp = temp->next;
head1 = head1->next;
head2 = head2->next;
}else{
carry = 0;
ListNode* nextNode = new ListNode(sum);
temp->next = nextNode;
temp = temp->next;
head1 = head1->next;
head2 = head2->next;
}
}
while(head1 != NULL){
int sum = head1->data + carry;
if(sum >= 10){
carry = 1;
sum = sum - 10;
ListNode* nextNode = new ListNode(sum);
temp->next = nextNode;
temp = temp->next;
head1 = head1->next;
}else{
carry = 0;
ListNode* nextNode = new ListNode(sum);
temp->next = nextNode;
temp = temp->next;
head1 = head1->next;
}
}
while(head2 != NULL){
int sum = head2->data + carry;
if(sum >= 10){
carry = 1;
sum = sum - 10;
ListNode* nextNode = new ListNode(sum);
temp->next = nextNode;
temp = temp->next;
head2 = head2->next;
}else{
carry = 0;
ListNode* nextNode = new ListNode(sum);
temp->next = nextNode;
temp = temp->next;
head2 = head2->next;
}
}
if(carry != 0){
ListNode* nextNode = new ListNode(carry);
temp->next = nextNode;
temp = temp->next;
}
// delete dummy
ListNode* prev = dummy;
dummy = dummy->next;
prev->next = NULL;
delete prev;
return dummy;
}
int main(){
ListNode* node1 = new ListNode(7);
ListNode* head1 = node1;
ListNode* tail1 = node1;
insertAtTail(tail1, 5);
insertAtTail(tail1, 9);
insertAtTail(tail1, 4);
insertAtTail(tail1, 6);
print(head1);
ListNode* node2 = new ListNode(8);
ListNode* head2 = node2;
ListNode* tail2 = node2;
insertAtTail(tail2, 4);
print(head2);
head1 = addTwoNumbers(head1, head2);
print(head1);
return 0;
}