栈内部逻辑简单版

//一个简单模仿栈逻辑的程序
public class StackOfInteger {
//实例变量
public  static final int  DEFAULT_CAPACITY=18;
private int[] elements;
private int size;
//构造无参栈类初始化
public StackOfInteger(){
this(18);
}

//构造有参
public StackOfInteger(int capacity){
elements =new int[capacity];
}
//构建相关操作方法
//empty()判断是否为空
public Boolean empty(){
return size == 0;
}
//peek()返回栈顶值
public int peek(){
return elements[size-1];
}
//push()将值加入栈顶
public void push(int value){
if(size==DEFAULT_CAPACITY){
int[] temp=new int[size*2];
System.arraycopy(elements,0,temp,0,size);
}
elements[size++]=value;

}
//pop()将栈顶值返回并删除
public int pop(){
return elements[--size];
}
//getSize返回栈中元素的个数
public int getSize(){
return size;
}

}