-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyLinkedList.java
More file actions
127 lines (112 loc) · 2.76 KB
/
Copy pathMyLinkedList.java
File metadata and controls
127 lines (112 loc) · 2.76 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
package collection.list;
public class MyLinkedList<E> implements MyList<E> {
static class Node<E>{
E item;
Node<E> next;
public Node(E item) {
this.item = item;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("[");
Node<E> x = this;
while(x != null) {
sb.append(x.item);
if (x.next != null) {
sb.append("->");
}
x = x.next;
}
sb.append("]");
return sb.toString();
}
}
private Node<E> first;
private int size = 0;
@Override
public void add(E e) {
Node<E> newNode = new Node<>(e);
if (first == null) {
first = newNode;
} else {
Node<E> lastNode = getLastNode();
lastNode.next = newNode;
}
size++;
}
@Override
public void add(int index, E e) {
Node<E> newNode = new Node<>(e);
if (index == 0) {
newNode.next = first;
first = newNode;
} else {
Node<E> prev = getNode(index -1);
newNode.next = prev.next;
prev.next = newNode;
}
size++;
}
private Node<E> getLastNode() {
Node<E> x = first;
while(x.next != null){
x = x.next;
}
return x;
}
@Override
public E set(int index, E element) {
Node<E> x = getNode(index);
E oldValue = x.item;
x.item = element;
return oldValue;
}
@Override
public E get(int index) {
Node<E> x = getNode(index);
return x.item;
}
private Node<E> getNode(int index) {
Node<E> x = first;
for(int i = 0; i < index; i++){
x = x.next;
}
return x;
}
@Override
public int indexOf(E o) {
int index = 0;
for(Node<E> x = first; x != null; x = x.next){
if(x.item == o) return index;
index++;
}
return -1;
}
@Override
public E remove(int index){
Node<E> removeNode = getNode(index);
E removedItem = removeNode.item;
if(index == 0){
first = removeNode.next;
}else {
Node<E> prev = getNode(index-1);
prev.next = removeNode.next;
}
removeNode.item = null;
removeNode.next = null;
size--;
return removedItem;
}
@Override
public int size() {
return size;
}
@Override
public String toString() {
return "MyLinkedListV1{" +
"first=" + first +
", size=" + size +
'}';
}
}