实现栈

发表于 分类于 阅读次数：

创建功能接口

1
2
3
4
5
6
7
public interface Stack<E> {
	int getSize();
	boolean isEmpty();
	void push(E e);
	E pop();
	E peek();
}

实现栈的功能

借助之前实现的数组类，主要调用addLast和deleteLast方法。

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
public class ArrayStack<E> implements Stack<E> {
	Array array;

	public ArrayStack(int capacity) {
		array = new Array(capacity);
	}
	 public ArrayStack() {
		 array=new Array();
	}


	@Override
	public int getSize() {
		return array.getSize();
	}

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

	public int getCapicity() {
		return array.getCapacity();
	}
	@Override
	public void push(E e) {
		array.addLast(e);

	}

	@Override
	public E pop() {
		return array.deleTeLast();
	}

	@Override
	public E peek() {
		return array.getLast();
	}
	@Override
	public String toString() {
		StringBuilder stringBuilder = new StringBuilder();
		stringBuilder.append("Stack:");
		stringBuilder.append("[");
		for (int i = 0; i < array.getSize(); i++) {
			stringBuilder.append(array.find(i));
			if (i != array.getSize() - 1) {
				stringBuilder.append(",");
			}
		}
		stringBuilder.append("]  top");
		return stringBuilder.toString();

	}

}

测试类

1
2
3
4
5
6
7
8
9
10
11
12
13
public class ArrayStackTest {
	public static void main(String[] args) {
		ArrayStack arrayStack=new ArrayStack() ;
		for(int i=0; i < 5;i++) {
			arrayStack.push(i);
			System.out.println(arrayStack);
		}
		arrayStack.pop();
		System.out.println(arrayStack);

	}

}

输出示例

1
2
3
4
5
6
Stack:[0]  top
Stack:[0,1]  top
Stack:[0,1,2]  top
Stack:[0,1,2,3]  top
Stack:[0,1,2,3,4]  top
Stack:[0,1,2,3]  top
0%