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
| package DataStructures.Stack;
public class ArrayStackDemo {
public static void main(String[] args) {
ArrayStack stack = new ArrayStack(8); stack.push(1); stack.push(2); stack.push(8); stack.push(4); stack.push(5); stack.list(); } static class ArrayStack { private int maxSize; private int[] stack; private int top = -1; public ArrayStack(int maxSize) { this.maxSize = maxSize; stack = new int[this.maxSize]; } public boolean ifFull() { return top == maxSize - 1; } public boolean ifEmpty() {
return top == -1; }
public void push(int value) {
if (ifFull()) return; top++; stack[top] = value;
}
public int pop() {
if (ifEmpty()) { System.out.println("栈空 请插入数据进行测试"); return 0; }
int cur = top;
int value = stack[top]; top--; return value;
}
public void list() { if (ifEmpty()) { System.out.println("栈空 请插入数据进行测试"); return; } for (int i = top; i > -1; i--) {
System.out.println(stack[i]);
}
} } }
|