-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayStack.java
More file actions
121 lines (105 loc) · 2.63 KB
/
ArrayStack.java
File metadata and controls
121 lines (105 loc) · 2.63 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
package structires.stack;
/**
* Created : zzc
* Time : 2017/9/25
* Email : zzcm159@gmail.com
* Description :
*/
class ArrayStack<E> implements Stack<E> {
private static final int SIZE_DEFAULT = 10;
private Object[] itemArr;
private int maxSize;
private int size;
public ArrayStack() {
maxSize = SIZE_DEFAULT;
itemArr = new Object[maxSize];
}
public ArrayStack(int size) {
this.maxSize = size;
itemArr = new Object[maxSize];
}
@Override
public void push(E item) {
if (item == null) return;
ensureSize();
itemArr[size] = item;
size++;
}
@Override
public E pop() {
if (size == 0) return null;
return (E) itemArr[--size];
}
@Override
public E top() {
return (E) itemArr[size];
}
@Override
public E bottom() {
return (E) itemArr[0];
}
@Override
public E get(int index) {
return (E) itemArr[index];
}
@Override
public boolean insert(int index, E item) {
if (index < 0 || index > size) return false;
ensureSize();
System.arraycopy(itemArr, index, itemArr, index + 1, size - index);
itemArr[index] = item;
size++;
return true;
}
@Override
public E set(int index, E item) {
if (index < 0 || index > size) return null;
E old = (E) itemArr[index];
itemArr[index] = item;
return old;
}
@Override
public boolean remove(E item) {
if (item == null) return false;
int index = -1;
for (int i = 0; i < size; i++) {
if (item.equals(itemArr[i])) {
index = i;
break;
}
}
return index == -1 ? false : remove(index);
}
@Override
public boolean remove(int index) {
if (index < 0 || index > size) return false;
if (index == size) {
itemArr[size] = null;
} else {
System.arraycopy(itemArr, index + 1, itemArr, index, size - index - 1);
}
size--;
return true;
}
@Override
public int size() {
return size;
}
@Override
public boolean contains(E item) {
if (item == null) return false;
for (int i = 0; i < size; i++) {
if (item.equals(itemArr[i])) {
return true;
}
}
return false;
}
private void ensureSize() {
if (size == maxSize - 1) {
Object[] arr = new Object[maxSize *= 2];
System.arraycopy(itemArr, 0, arr, 0, size);
itemArr = arr;
}
}
}