Repository navigation
Expand file tree
/
Copy pathSimpleArrayStack.java
More file actions
84 lines (74 loc) · 1.95 KB
/
Copy pathSimpleArrayStack.java
File metadata and controls
84 lines (74 loc) · 1.95 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
package stack;
import java.util.Arrays;
import java.util.EmptyStackException;
import java.util.Iterator;
public class SimpleArrayStack<V> implements SimpleStack<V>, Iterable<V> {
private V[] array = null;
private static final int DEFAULT_CAPACITY = 10;
private int size = 0;
private int lastindex;
@Override
public boolean put(V value) {
if (array == null) {
array = (V[]) new Object[DEFAULT_CAPACITY];
}
if(size == array.length){
array = Arrays.copyOf(array, array.length * 2);
}
array[size] = value;
checkCapacity();
size++;
return true;
}
private void checkCapacity() {
if (array.length / 2 == size) {
array = Arrays.copyOf(array, size);
}
if(size == array.length){
array = Arrays.copyOf(array, array.length * 2);
}
}
@Override
public V pop() {
if (size != 0) {
int primarySize = size;
size--;
return array[primarySize-1];
}
throw new EmptyStackException();
}
@Override
public V peek() {
if (size != 0) {
return array[size-1];
}
throw new EmptyStackException();
}
@Override
public int getSize() {
return size;
}
@Override
public Iterator<V> iterator() {
return new Iterator<V>() {
private int cursorSize = size;
@Override
public boolean hasNext() {
if (cursorSize != 0) {
return true;
} else {
return false;
}
}
@Override
public V next() {
if (hasNext()) {
int returnedCursor = cursorSize;
cursorSize--;
return array[cursorSize];
}
return null;
}
};
}
}