forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedMenu.java
More file actions
279 lines (255 loc) · 7.31 KB
/
Copy pathLinkedMenu.java
File metadata and controls
279 lines (255 loc) · 7.31 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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
import java.util.*;
public class LinkedMenu {
Node head;
static class Node
{
int data;
Node next;
Node(int d)
{
data=d;
next=null;
}
}
public static LinkedMenu add(LinkedMenu li,int b)
{
Node newNode=new Node(b);
if(li.head==null)
{
li.head=newNode;
}
else
{
Node last=li.head;
while(last.next!=null)
{
last=last.next;
}
last.next=newNode;
}
return li;
}
public static LinkedMenu insert(LinkedMenu li,int index,int data)
{
Node newNode=new Node(data);
Node count=li.head;
int c=0;
if(li.head==null)
{
li.head=newNode;
}
while(count.next!=null)
{
c++;
count=count.next;
}
if(c>index)
{
if(index==0)
{
Node start=li.head;
li.head=newNode;
newNode.next=start;
}
else if(c==index)
{
Node last=li.head;
while(last.next!=null)
{
last=last.next;
}
last.next=newNode;
}
else
{
Node curr=li.head;
int a=0;
Node d=curr.next;
while(a<index-1)
{
curr=curr.next;
d=d.next;
a++;
}
curr.next=newNode;
newNode.next=d;
}
}
else
{
System.out.println("Invalid index");
}
return li;
}
public static LinkedMenu delete(LinkedMenu li,int index)
{
Node c=li.head;
if(li.head==null)
{
System.out.println("linked list does not exist");
}
int count=0;
while(c.next!=null)
{
count++;
c=c.next;
}
if(index>count)
{
System.out.println("Invalid input");
}
else
{
Node d=li.head;
int a=0;
if(index==0)
{
li.head=d.next;
}
else if(index==count)
{
d=li.head;
while(d.next.next!=null)
{
d=d.next;
}
d.next=null;
}
else
{
Node dd=d.next.next;
while(a<(index-1))
{
d=d.next;
dd=dd.next;
a++;
}
d.next=dd;
}
}
return li;
}
public static LinkedMenu display(LinkedMenu li)
{
Node curr=li.head;
if(li.head==null)
{
System.out.println("Linked list does not exist");
}
else
{
while(curr.next!=null)
{
System.out.print(curr.data);
curr=curr.next;
}
System.out.print(curr.data);
//System.out.println(" ");
}
return li;
}
public static void main(String[] args)
{
LinkedMenu li=new LinkedMenu();
Scanner sc=new Scanner(System.in);
int index;
int n;
/* int n=sc.nextInt();
for(int i=0;i<n;i++)
{
int b=sc.nextInt();
add(li,b);
}*/
String s="yes";
while(s.equals("yes")||s.equals("y"))
{
System.out.println("enter your choice");
System.out.println("1:Make a list");
System.out.println("2:insert");
System.out.println("3:Delete");
System.out.println("4:Display");
int opt=sc.nextInt();
switch(opt)
{
case 1:
System.out.println("Enter the number of elements:");
n=sc.nextInt();
System.out.println("Enter the elements: ");
for(int i=0;i<n;i++)
{
int b=sc.nextInt();
add(li,b);
}
break;
case 2:
if(li.head==null)
{
System.out.println("no list found ");
System.out.println("make a list first");
System.out.println("Enter the number of elements:");
n=sc.nextInt();
System.out.println("Enter the elements: ");
for(int i=0;i<n;i++)
{
int b=sc.nextInt();
add(li,b);
}
}
System.out.println("Enter the index where you want to insert");
index=sc.nextInt();
int data=sc.nextInt();
insert(li,index,data);
System.out.println("Do you want to continue");
s=sc.next();
break;
case 3:
if(li.head==null)
{
System.out.println("no list found ");
System.out.println("make a list first");
System.out.println("Enter the number of elements:");
n=sc.nextInt();
System.out.println("Enter the elements: ");
for(int i=0;i<n;i++)
{
int b=sc.nextInt();
add(li,b);
}
}
System.out.println("Enter the index where you want to delete");
index=sc.nextInt();
delete(li,index);
System.out.println("Do you want to continue");
s=sc.next();
break;
case 4:
if(li.head==null)
{
System.out.println("no list found ");
System.out.println("make a list first");
System.out.println("Enter the number of elements:");
n=sc.nextInt();
System.out.println("Enter the elements: ");
for(int i=0;i<n;i++)
{
int b=sc.nextInt();
add(li,b);
}
}
System.out.println("The elements of the list are:");
display(li);
System.out.println("Do you want to continue");
s=sc.next();
break;
default:
System.out.println("the option tha you have entered is not valid");
System.out.println("Do you want to continue");
s=sc.next();
}
}
if(s.equals("no")||s.equals("n"))
{
System.out.println("Thanks");
}
}
}