-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddTwoNo.INLinkedList.cpp
135 lines (118 loc) · 2.29 KB
/
AddTwoNo.INLinkedList.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
// { Driver Code Starts
// driver
#include <bits/stdc++.h>
using namespace std;
/* Linked list Node */
struct Node {
int data;
struct Node* next;
Node(int x) {
data = x;
next = NULL;
}
};
struct Node* buildList(int size)
{
int val;
cin>> val;
Node* head = new Node(val);
Node* tail = head;
for(int i=0; i<size-1; i++)
{
cin>> val;
tail->next = new Node(val);
tail = tail->next;
}
return head;
}
void printList(Node* n)
{
while(n)
{
cout<< n->data << " ";
n = n->next;
}
cout<< endl;
}
// } Driver Code Ends
/* node for linked list:
struct Node {
int data;
struct Node* next;
Node(int x) {
data = x;
next = NULL;
}
};
*/
class Solution
{
public:
//Function to add two numbers represented by linked list.
struct Node *rev(struct Node* head)
{
if(head==NULL)
return head;
struct Node*p =NULL;
struct Node*c=head;
struct Node*t;
while(c!=NULL)
{
t=c->next;
c->next=p;
p=c;
c=t;
}
return p;
}
struct Node* addTwoLists(struct Node* first, struct Node* second)
{
// code here
first=rev(first);
second=rev(second);
int c=0;
struct Node *head=new Node(0);
Node *temp=head;
while(first!=NULL||second!=NULL||c==1)
{
int sum=0;
if(first!=NULL)
{
sum+=first->data;
first=first->next;
}
if(second!=NULL)
{
sum+=second->data;
second=second->next;
}
sum+=c;
c=sum/10;
sum=sum%10;
Node *dummy=new Node(sum);
temp->next=dummy;
temp=temp->next;
}
Node *ans=rev(head->next);
return ans;
}
};
// { Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int n, m;
cin>>n;
Node* first = buildList(n);
cin>>m;
Node* second = buildList(m);
Solution ob;
Node* res = ob.addTwoLists(first,second);
printList(res);
}
return 0;
}
// } Driver Code Ends