Java实现数据结构中的栈

package test;


public class Stack {
private int maxSize;// 堆栈的大小
private int[] stackArray;
private int top;// 堆栈顶部指针


public Stack(int s) {
maxSize = s;
stackArray = new int[maxSize];
top = -1;
}


public void push(int j) {
if (!isFull()) {
stackArray[++top] = j;
} else
return;
}


public int pop() {
return stackArray[top--];
}


public int peek() {
// 得到栈顶数据
return stackArray[top];
}


public boolean isEmpty() {
return (top == -1);
}


public boolean isFull() {
return (top == maxSize - 1);
}


public String toString() {
StringBuffer sb = new StringBuffer();
for (int i = top; i >= 0; i--) {
sb.append("" + stackArray[i] + " ");
}
return sb.toString();
}


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Stack stack = new Stack(10);
stack.push(20);
stack.push(30);
stack.push(50);
stack.push(60);
System.out.println(stack);
System.out.println(stack.peek());
stack.pop();
System.out.println(stack);
}


}