-
Notifications
You must be signed in to change notification settings - Fork 0
/
dll.java
318 lines (277 loc) · 6.96 KB
/
dll.java
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
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
import java.util.*;
import java.lang.*;
class node
{
int data;
node next;
node previous;
node(int data)
{
this.data=data;
this.next=null;
this.previous=null;
}
}
class doublell
{
node head;
node tail;
public doublell(){
this.head = null;
this.tail = null;
}
//insert in the beginning
public void insert_beginning(int data)
{
node newnode=new node(data);
if(head==null)
{
head=newnode;
tail = newnode;
}
else
{
newnode.next=head;
head.previous=newnode;
head=newnode;
}
}
//insert in the last
public void insert_end(int data)
{
node newnode = new node(data);
if(head==null)
{
head=newnode;
tail=newnode;
}
else{
newnode.previous=tail;
tail.next=newnode;
tail=newnode;
}
}
// insert in the middle
public void insert_middle(int data, int where_to_insert)
{
node newnode=new node(data);
node current=head.next;
node second=head;
while(current.data!=where_to_insert)
{
current=current.next;
second=second.next;
}
newnode.next=current;
newnode.previous=second;
current.previous=newnode;
second.next=newnode;
second=second.next;
}
//delete from the first
public void delete_beg()
{
if(head==null)
{
System.out.println("the list is empty");
}
else
{
head=head.next;
head.previous=null;
}
}
//delete the elements from the last
public void del_last()
{
if(head==null)
{
System.out.println("the list is empty");
}
else{
tail=tail.previous;
tail.next=null;
}
}
//delete from the middle
public void del_middle(int which_data)
{
node current=head;
while(current.data!=which_data)
{
current=current.next;
}
current.previous.next=current.next;
current.next.previous=current.previous;
}
public void display()
{
node current=head;
while(current!=null)
{
System.out.print(current.data + "->");
current=current.next;
}
}
// to find the max element in a linked list;
public void max_ele()
{
int max=Integer.MIN_VALUE;
node current=head;
System.out.println(" ");
while(current!=null)
{
if(max<=current.data)
{
max=current.data;
}
current=current.next;
}
System.out.println("the maximum element of the linked list is"+max);
}
// to find the minimum element of a linked list
public void min_ele()
{
int min=Integer.MAX_VALUE;
node current=head;
System.out.println(" ");
while(current!=null)
{
if(min>=current.data)
{
min=current.data;
}
current=current.next;
}
System.out.println("the smallest element of the linked list is"+min);
}
// to sort the linked list in ascending order
public void sorting()
{
if(head==null)
{
return ;
}
else
{
node current=head;
while(current!=null)
{
node present=current.next;
while(present!=null)
{
if(current.data>present.data)
{
int temp=current.data;
current.data=present.data;
present.data=temp;
}
present=present.next;
}
current=current.next;
}
}
}
//to reverse the element of the linked list
public void reverse()
{
node previous=null;
node current=head;
node nextnode=head;
while(nextnode!=null)
{
nextnode=nextnode.next;
current.next=previous;
previous=current;
current=nextnode;
}
head=previous;
}
//to remove the dublicate elements of the linked list
public void find_dublicate()
{
System.out.println("the dublicate elements are");
node current=head;
if(head==null)
{
System.out.println("no dublicate element");
}
else
{
while(current!=null)
{
node present=current.next;
while(present!=null)
{
if(current.data==present.data)
{
System.out.println(+current.data);
break;
}
present=present.next;
}
current=current.next;
}
}
}
// to remove the element from the sorted list
// to delete the dublicate elements of the list
// public void delete_dublicate()
// {
// // int count=0;
// node current=head;
// while(current!=null)
// {
// node last_present=current;
// node present=current.next;
// while(present!=null)
// {
// // System.out.println("the");
// if(current.data==present.data)
// {
// // System.out.println("the");
// // count++;
// last_present.next=present.next;
// //present=present.next;
// }
// present=present.next;
// last_present=last_present.next;
// }
// current=current.next;
// }
// }
}
public class dll {
public static void main(String[] args)
{
doublell aa=new doublell();
aa.insert_beginning(20);
aa.insert_beginning(10);
aa.insert_beginning(780);
aa.insert_beginning(70);
aa.insert_beginning(500);
aa.insert_beginning(234);
aa.insert_middle(10,70);
aa.insert_middle(67,10);
aa.insert_beginning(10);
aa.insert_beginning(100);
aa.insert_end(5000);
aa.insert_middle(6789,780);
aa.delete_beg();
aa.del_last();
aa.del_middle(6789);
aa.display();
//aa.find_dublicate();
aa.max_ele();
aa.min_ele();
System.out.println("the linked list after sorting is:");
aa.sorting();
aa.display();
aa.reverse();
System.out.println(" the reverse of the linked list is ");
aa.display();
aa.find_dublicate();
// aa.delete_dublicate();
aa.display();
}
}