栈先进后出。
import java.util.Arrays;
public class EFanXingStack<E> {
public Object[] data ;
public int size = 0;
/**
* 入栈
*
* @param i 我
*/
public void push(E i){
data[size ++] = i;
if(size == data.length){
data = Arrays.copyOf(data,data.length*2);
}
}
public EFanXingStack(int length) {
this.data = new Object[length];
}
public EFanXingStack() {
this.data = new Object[10];
}
/**
* 出栈
*
* @return int
*/
public E pop(){
if(size == 0){
throw new RuntimeException("栈为空");
}
E old = (E)data[size -1];
size = size -1 ;
return old;
}
}