-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinkcompare.cpp
More file actions
135 lines (130 loc) · 1.86 KB
/
linkcompare.cpp
File metadata and controls
135 lines (130 loc) · 1.86 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
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
struct node
{
string data;
struct node* next;
};
struct node* head=NULL;
struct node* head1=NULL;
struct node* getnewnode(string x)
{
struct node* newnode=new node;
newnode->data=x;
newnode->next=NULL;
return newnode;
}
void insert()
{
string x,y;
cout<<"enter the string for 1st list\n";
cin>>x;
cout<<"enter the string for 2st list\n";
cin>>y;
struct node* newnode=getnewnode(x);
struct node* newnode1=getnewnode(y);
struct node* temp=head;
struct node* temp1=head1;
if(head==NULL)
{
head=newnode;
}
else
{
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=newnode;
}
if(head1==NULL)
{
head1=newnode1;
}
else
{
while(temp1->next!=NULL)
{
temp1=temp1->next;
}
temp1->next=newnode1;
}
}
int check(string x,string y)
{
int ret=x.compare(y);
return ret;
}
void compare()
{
int res[100],i=0,flag=0;
struct node* temp=head;
struct node* temp1=head1;
while(temp!=NULL || temp1!=NULL)
{
res[i]=check(temp->data,temp1->data);
//cout<<res;
temp=temp->next;
temp1=temp1->next;
i++;
}
int n=sizeof(res)/sizeof(res[0]);
for(i=0;i<n;i++)
{
//cout<<res[i]<<" "<<endl;;
if(res[i]==1)
{
flag=1;
}
}
if(flag==0)
{
cout<<"list same\n";
}
else
{
cout<<"not same\n";
}
}
void display()
{
struct node* temp=head;
struct node* temp1=head1;
cout<<"first list\n";
while(temp!=NULL)
{
cout<<temp->data<<"-->";
temp=temp->next;
}
cout<<endl;
cout<<"second list\n";
while(temp1!=NULL)
{
cout<<temp1->data<<"-->";
temp1=temp1->next;
}
cout<<endl;
}
int main()
{
int ch;
do{
cout<<"\n1.insert() \n2.display() \n3.compare \n ";
cin>>ch;
switch(ch)
{
case 1:insert();
break;
case 2:display();
break;
case 3:compare();
break;
default:
cout<<"invalid choice\n";
break;
}
}while(ch!=4);
return 0;
}