实现Stack

1
2
3
4
5
6
7
public interface Stack<E> {
void push(E e);
E pop();
E peek();
int getSize();
boolean isEmpty();
}
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
public class ArrayStack<E> implements Stack<E> {
// 这里使用自己实现的ArrayList
private ArrayList<E> array;
public ArrayStack(int capacity){
array = new ArrayList<>(capacity);
}
public ArrayStack(){
array = new ArrayList<>();
}
@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 int getSize() {
return array.getSize();
}

@Override
public boolean isEmpty() {
return array.isEmpty();
}

public int getCapacity() {
return array.getcapacity();
}

@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();
}
}
-------------本文结束感谢您的阅读-------------