-
Notifications
You must be signed in to change notification settings - Fork 0
/
DoubleLinkedList.java
103 lines (99 loc) · 2.56 KB
/
DoubleLinkedList.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
package linkedlist;
public class DoubleLinkedList {
class Node{
Object ele;
Node prev;
Node next;
Node(Object e){
ele = e;
prev = null;
next = null;
}
Node(Object e, Node p , Node n){
ele = e;
prev = p;
next = n;
}
}
private Node first = null;
private int count = 0;
public int size(){
return count;
}
public void add(Object e){
if (first == null){
first = new Node(e);
count++;
return;
}
Node curr = first;
while (curr.next != null){
curr = curr.next;
}
curr.next = new Node(e,curr,null);
count++;
}
public void add(int index , Object e){
if (index <= -1 || index >= size())
throw new IndexOutOfBoundsException();
if (index == 0){
first = new Node(e,null,first);
count++;
return;
}
Node curr = first;
for (int i = 1; i < index; i++){
curr = curr.next;
}
Node n = new Node(e,curr,curr.next);
curr.next.prev = n;
curr.next = n;
count++;
}
public Object get(int index){
if (index <= -1 || index >= size())
throw new IndexOutOfBoundsException();
Node curr = first;
for (int i = 0; i< index; i++){
curr = curr.next;
}
return curr.ele;
}
public void remove(int index){
if (index <= -1 || index >= size())
throw new IndexOutOfBoundsException();
if (index == 0){
first = first.next;
count--;
return;
}
Node curr = first;
for (int i = 1; i <= index; i++){
curr = curr.next;
}
curr.next.prev = curr.prev;
curr.prev.next = curr.next;
count--;
}
public static void main(String[] args) {
DoubleLinkedList d = new DoubleLinkedList();
d.add(10);
d.add(0,60);
d.add(20);
d.add(30);
d.add(50);
for (int i = 0; i <d.size(); i++){
System.out.println(d.get(i));
}
d.remove(0);
d.remove(2);
System.out.println(d.size());
for (int i = 0; i <d.size(); i++){
System.out.println(d.get(i));
}
System.out.println("____________________________");
for (int i = d.size()-1; i >= 0; i--){
System.out.println(d.get(i));
}
}
}