Repository navigation
Expand file tree
/
Copy pathChoisingLinkedList.java
More file actions
151 lines (128 loc) · 3.26 KB
/
Copy pathChoisingLinkedList.java
File metadata and controls
151 lines (128 loc) · 3.26 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
package adt;
public class ChoisingLinkedList<E>implements DoubleLinkedList<E>{
private int size;
private Node<E> head;
private Node<E> tail;
public ChoisingLinkedList() {
this.size = 0;
}
@Override
public E get(int index) {
if(index >= this.size || index < 0) throw new IllegalArgumentException();
Node<E> indexNode = this.findNode(index);
return indexNode.element;
}
private Node<E> findNode(int index){
Node<E> indexNode = this.head;
for(int i = 0; i < index; i++) {
indexNode = indexNode.next;
}
return indexNode;
}
@Override
public int size() {
return this.size;
}
@Override
public void set(int index, E element) {
// TODO Auto-generated method stub
if(this.size < index) throw new IllegalArgumentException("size : " + this.size);
if(index < 0) throw new IllegalArgumentException();
if(this.size == 0) {
this.init(element);
} else if(index == 0) {
this.addFirst(element);
} else if(index == this.size) {
this.addLast(element);
} else {
this.addGeneral(index, element);
}
this.size++;
}
private void init(E element) {
Node<E> curNode = new Node<E>(element, null, null);
this.head = curNode;
this.tail = curNode;
}
private void addFirst(E element) {
Node<E> curNode = new Node<E>(element, null, this.head);
this.head.prev = curNode;
this.head = curNode;
}
private void addLast(E element) {
Node<E> curNode = new Node<E>(element, this.tail, null);
this.tail.next = curNode;
this.tail = curNode;
}
private void addGeneral(int index, E element) {
Node<E> indexNode = this.findNode(index);
Node<E> curNode = new Node<E>(element, indexNode.prev, indexNode);
indexNode.prev = curNode;
curNode.prev.next = curNode;
}
@Override
public E remove(int index) {
// TODO Auto-generated method stub
if(this.size <= index) throw new IllegalArgumentException("size : " + this.size);
if(index < 0) throw new IllegalArgumentException();
E value = null;
if(index == 0) {
value = this.removeFirst();
} else if(index == this.size - 1) {
value = this.removeLast();
} else {
value = this.removeGeneral(index);
}
this.size--;
return value;
}
private E removeFirst() {
E value = this.head.element;
if(this.head.next == null) {
this.head.element = null;
}
else {
this.head.next.prev = null;
this.head = this.head.next;
}
return value;
}
private E removeLast() {
E value = this.tail.element;
this.tail = tail.prev;
this.tail.next = null;
return value;
}
private E removeGeneral(int index) {
Node<E> indexNode = this.findNode(index);
E value = indexNode.element;
indexNode.prev.next = indexNode.next;
indexNode.next.prev = indexNode.prev;
return value;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
Node<E> temp = head;
sb.append(temp + ",");
for(int i = 1; i < this.size; i++) {
temp = temp.next;
sb.append(temp + ",");
}
return "[" + sb.toString().substring(0, sb.length()-1) +"]";
}
private class Node<E> {
private E element;
Node<E> prev;
Node<E> next;
public Node(E element, Node<E> prev, Node<E> next) {
this.element = element;
this.prev = prev;
this.next = next;
}
@Override
public String toString() {
return String.valueOf(this.element);
}
}
}