-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2.5(sumlist-followUp).cpp
More file actions
159 lines (132 loc) · 2.01 KB
/
2.5(sumlist-followUp).cpp
File metadata and controls
159 lines (132 loc) · 2.01 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
153
154
155
156
157
158
159
#include <iostream>
#include <math.h>
#include <stack>
using namespace std;
class linkedlist{
public:
struct Node{
int data;
Node* next;
};
linkedlist(){
head = NULL;
}
void insert(int val){
Node *n= new Node();
n->data = val;
n->next = head;
head = n;
}
void display(){
Node *temp;
if(head==NULL){
//cout<<"empty"; prob
}else{
temp = head;
while(temp!=NULL){
cout<<temp->data<<" ";
temp = temp->next;
}
}
}
int pop(){
Node *n ;
n=head;
head=head->next;
return n->data;
}
bool empty(){
if(head!=NULL){
return false;
}
return true;
}
int size(){
Node* s;
s= head;
int size=0;
while(s!=NULL){
s=s->next;
size++;
}
return size;
}
void samesize(linkedlist &a, linkedlist &b){
int diff =0;
bool aIsBig = false;
if(a.size()>b.size()){
aIsBig = true;
diff = a.size()-b.size();
}
else if(a.size()<b.size()){
diff = b.size() - a.size();
}
for(int i=0; i<diff; i++){
if(aIsBig){
b.insert(0);
}else{
a.insert(0);
}
}
}
linkedlist add(linkedlist a, linkedlist b){
stack <int> s;
linkedlist c;
Node* temp ;
Node* temp2 ;
int sum = 0;
int carry = 0;
temp = a.head;
temp2 = b.head;
int lastdig= 0;
while(temp!=NULL ){
sum = temp->data+temp2->data;
s.push(sum);
temp2=temp2->next;
temp=temp->next;
}
while(!s.empty()){
lastdig = (s.top()+carry);
carry = (lastdig>9)?1:0;
lastdig = lastdig%10;
c.insert(lastdig);
s.pop();
}
return c;
}
/*
~linkedlist(){
Node *temp = new Node();
while (head != NULL)
{
temp = head->next;
delete head;
head = temp;
}
delete temp;
}
*/
private:
Node* head;
};
int main(){
linkedlist a;
linkedlist b;
linkedlist res;
a.insert(7);
a.insert(5);
a.display();
cout<<endl;
b.insert(5);
b.insert(9);
b.insert(6);
b.insert(2);
b.insert(1);
b.insert(3);
b.display();
cout<<endl<<endl;
a.samesize(a, b);
res = a.add(a, b);
res.display();
return 0;
}