forked from codehouseindia/Java-Programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinked_List.java
More file actions
249 lines (246 loc) · 4.17 KB
/
Linked_List.java
File metadata and controls
249 lines (246 loc) · 4.17 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
//https://www.facebook.com/zawed.akhtar.7923/posts/965508713932178
//Subscribed by MySirG.com
import java.util.*;
import java.lang.*;
class Node
{
private int data;
private Node next;
public Node()
{
data=0;
next=null;
}
public Node(int d,Node n)
{
data=d;
next=n;
}
public void setData(int d)
{
data=d;
}
public void setNext(Node n)
{
next=n;
}
public int getData()
{
return(data);
}
public Node getNext()
{
return(next);
}
}
class LinkedList
{
private int size;
private Node start;
public LinkedList()
{
size=0;
start=null;
}
public boolean isEmpty()
{
if(start==null)
return(true);
else
return(false);
}
public int getListSize()
{
return(size);
}
public void viewList()
{
Node t;
if(isEmpty())
{
System.out.println("List is empty");
}
else
{
t=start;
for(int i=1;i<=size;i++)
{
System.out.print(" "+t.getData());
t=t.getNext();
}
}
System.out.print("\n");
}
public void insertAtFirst(int val)
{
Node n;
n=new Node();
n.setData(val);
n.setNext(start);
start=n;
size=size+1;
}
public void insertAtLast(int val)
{
Node n,t;
n=new Node();
n.setData(val);
if(start==null)
{
start=n;
}
else
{
t=start;
while(t.getNext()!=null)
{
t=t.getNext();
}
t.setNext(n);
}
size=size+1;
}
public void insertAtPos(int val,int pos)
{
Node n,t;
if(pos==1)
{
insertAtFirst(val);
}
else if(pos==size+1)
{
insertAtLast(val);
}
else if(pos>1 && pos<=size)
{
n=new Node(val,null);
t=start;
for(int i=1;i<pos-1;i++)
{
t=t.getNext();
}
n.setNext(t.getNext());
t.setNext(n);
size=size+1;
}
else
{
System.out.println("Insertion not possible at position" +pos);
}
}
public void deleteFirst()
{
if(start==null)
{
System.out.println("List is empty");
}
else
{
start=start.getNext();
size=size-1;
}
}
public void deleteLast()
{
if(start==null)
{
System.out.println("List is empty");
}
else if(size==1)
{
start=null;
size=size-1;
}
else
{
Node t;
t=start;
for(int i=1;i<size-1;i++)
{
t=t.getNext();
}
t.setNext(null);
}
size=size-1;
}
public void deleteAtPos(int pos)
{
if(start==null)
System.out.println("List is empty");
else if(pos<1 || pos>size)
System.out.println("Invalid Position");
else if(pos==1)
deleteFirst();
else if(pos==size)
deleteLast();
else
{
Node t,t1;
t=start;
for(int i=1;i<pos-1;i++)
t=t.getNext();
t1=t.getNext();
t.setNext(t1.getNext());
size--;
}
}
}
public class Test
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
LinkedList list=new LinkedList();
boolean flag=true;
while(flag)
{
System.out.println("1.Add item to the list of start");
System.out.println("2.Add item to the list of last");
System.out.println("3.Add item to the list of position");
System.out.println("4.Delete First item from the list");
System.out.println("5.Delete Last item from the list");
System.out.println("6.Delete item from the list which given position");
System.out.println("7.View List");
System.out.println("8:Exit");
System.out.println("Enter your choice");
int ch=sc.nextInt();
int position,value;
switch(ch)
{
case 1:
System.out.println("Enter value of list item:");
value=sc.nextInt();
list.insertAtFirst(value);
break;
case 2:
System.out.println("Enter value of list item:");
value=sc.nextInt();
list.insertAtLast(value);
break;
case 3:
System.out.println("Enter the position:");
position=sc.nextInt();
System.out.println("Enter value of list item:");
value=sc.nextInt();
list.insertAtPos(value,position);
break;
case 4:
list.deleteFirst();
break;
case 5:
list.deleteLast();
break;
case 6:
System.out.println("Enter the position:");
position=sc.nextInt();
list.deleteAtPos(position);
break;
case 7:
list.viewList();
break;
default:
System.out.println("Invalid Choice. . . .");
}
}
}
}