使用数组完成
package zll.material.java_base_knowledge;
/**
* 用java写一个栈
* @author Administrator
*
*/
public class ArrayforStack {
int[] data;
int maxSize;
int top;
private ArrayforStack(int maxSize){
this.maxSize = maxSize;
data = new int[maxSize];
top = -1;
}
private boolean push(int n){
if(top==maxSize-1){
throw new RuntimeException("栈已满");
}
data[++top]=n;
return true;
}
private int pop(){
if(top==-1){
throw new RuntimeException("栈已空");
}
return data[top--];
}
private int peek(){
if(top == -1){
throw new RuntimeException("栈已空");
}
return data[top];
}
public static void main(String[] args) {
ArrayforStack s = new ArrayforStack(5);
s.push(1);
s.push(2);
s.push(3);
s.push(4);
s.push(5);
int peek = s.peek();
System.out.println(peek);
s.pop();
int peek1 = s.peek();
System.out.println(peek1);
s.pop();
int peek11 = s.peek();
System.out.println(peek11);
s.pop();
int peek111 = s.peek();
System.out.println(peek111);
s.pop();
int peek1111 = s.peek();
System.out.println(peek1111);
}
}