-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedArray.java
More file actions
178 lines (152 loc) · 3.01 KB
/
LinkedArray.java
File metadata and controls
178 lines (152 loc) · 3.01 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
public class LinkedArray<T> implements GenericArray<T> {
private Node first;
private Node last;
private int counter;
public LinkedArray() {
this.first = null;
this.last = null;
this.counter = 0;
}
public void clear() {
this.first = null;
this.last = null;
this.counter = 0;
}
public void add(T element) {
Node node = new Node(element, null);
if (counter == 0) {
first = node;
last = first;
} else {
last.setNext(node);
last = node;
}
counter++;
}
public void add(int pos, T element) {
Node node = new Node(element, null);
Node curr = first;
Node prev = null;
Node next = null;
if (pos == 0) {
node.setNext(first);
first = node;
} else {
for (int i = 0; i < counter; i++) {
if (i == (pos - 1))
prev = curr;
else if (i == pos) {
next = curr;
break;
}
curr = curr.getNext();
}
prev.setNext(node);
node.setNext(next);
}
counter++;
}
public T remove(int pos) {
T removed = null;
Node curr = first;
Node prev = null;
Node next = null;
if (pos == 0) {
removed = (T) first.getData();
first = first.getNext();
} else {
for (int i = 0; i < counter; i++) {
if (i == (pos - 1))
prev = curr;
else if (i == pos)
removed = (T) curr.getData();
else if (i == (pos + 1)) {
next = curr;
break;
}
curr = curr.getNext();
}
prev.setNext(next);
}
counter--;
return removed;
}
public boolean removeFirst(T element) {
Node curr = first;
for (int i = 0; i < counter; i++) {
if ((T) curr.getData() == element) {
remove(i);
return true;
}
curr = curr.getNext();
}
return false;
}
public T get(int pos) {
Node curr = first;
for (int i = 0; i < counter; i++) {
if (i == pos)
return (T) curr.getData();
curr = curr.getNext();
}
return null;
}
public T set(int pos, T element) {
Node curr = first;
T old = null;
for (int i = 0; i < counter; i++) {
if (i == pos) {
old = (T) curr.getData();
curr.setData(element);
break;
}
curr = curr.getNext();
}
return old;
}
public int indexOf(T element) {
Node curr = first;
for (int i = 0; i < counter; i++) {
if ((T) curr.getData() == element)
return i;
curr = curr.getNext();
}
return -1;
}
public int lastIndexOf(T element) {
Node curr = first;
int index = -1;
for (int i = 0; i < counter; i++) {
if ((T) curr.getData() == element)
index = i;
curr = curr.getNext();
}
return index;
}
public boolean contains(T element) {
Node curr = first;
for (int i = 0; i < counter; i++) {
if ((T) curr.getData() == element)
return true;
curr = curr.getNext();
}
return false;
}
public boolean isEmpty() {
return counter == 0;
}
public int size() {
return counter;
}
public T[] toArray() {
T[] array = (T[]) new Object[counter];
if (first == null)
return array;
Node curr = first;
for (int i = 0; i < counter; i++) {
array[i] = (T) curr.getData();
curr = curr.getNext();
}
return array;
}
}