Repository navigation
Expand file tree
/
Copy pathArrayStack.java
More file actions
79 lines (66 loc) · 1.56 KB
/
Copy pathArrayStack.java
File metadata and controls
79 lines (66 loc) · 1.56 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
/**
* @author mcrwayfun
* @version v1.0
* @date Created in 2018/10/04
* @description
*/
public class ArrayStack<E> implements Stack<E> {
private Array<E> array;
public ArrayStack(int capacity) {
array = new Array<>(capacity);
}
public ArrayStack() {
this(10);
}
// 获取栈中元素个数
@Override
public int getSize() {
return array.getSize();
}
// 获取栈容量
public int getCapacity() {
return array.getCapacity();
}
// 判断栈是否为空
@Override
public boolean isEmpty() {
return array.isEmpty();
}
// 将元素压入栈中
@Override
public void push(E e) {
array.addLast(e);
}
// 出栈
@Override
public E pop() {
return array.removeLast();
}
// 查看栈顶元素
@Override
public E peek() {
return array.getLast();
}
@Override
public String toString(){
StringBuilder res = new StringBuilder();
res.append("Stack: ");
res.append('[');
for(int i = 0 ; i < array.getSize() ; i ++){
res.append(array.get(i));
if(i != array.getSize() - 1)
res.append(", ");
}
res.append("] top");
return res.toString();
}
public static void main(String[] args) {
ArrayStack<Integer> stack = new ArrayStack<>();
for(int i = 0 ; i < 5 ; i ++){
stack.push(i);
System.out.println(stack);
}
stack.pop();
System.out.println(stack);
}
}