-
Notifications
You must be signed in to change notification settings - Fork 29
/
Copy pathArrayStack.java
62 lines (50 loc) · 1.17 KB
/
ArrayStack.java
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
package stack;
import array.Array;
/**
* 栈的一种实现方式:使用动态数组实现栈
*
* @param <E> 栈中的元素
*/
public class ArrayStack<E> implements Stack<E> {
private Array<E> array;
public ArrayStack(int capacity) {
array = new Array<>(capacity);
}
public ArrayStack() {
array = new Array<>();
}
@Override
public void push(E e) {
array.addLast(e);
}
@Override
public E pop() {
return array.deleteLast();
}
@Override
public E peek() {
return array.queryLast();
}
@Override
public int getSize() {
return array.getSize();
}
@Override
public boolean isEmpty() {
return array.isEmpty();
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
builder.append("Stack: ");
builder.append("[");
for (int i = 0; i < array.getSize(); i++) {
builder.append(array.query(i));
if (i != array.getSize() - 1) {
builder.append(",");
}
}
builder.append("] Top");
return builder.toString();
}
}