1.栈的填充
public class MyStack<E> {
private Object[]src=new Object[0];
public void push(E e){
Object[] dest=new Object[src.length+1];
dest[src.length]=e;
System.arraycopy(src,0,dest,0,src.length);
src=dest;
} 2.查看栈顶public E get(){
E e=(E)src[src.length-1];
return e;3.出栈public E poll(){
E e=(E)src[src.length-1];
Object[] dest=new Object[src.length-1];
System.arraycopy(src, 0, dest,0, src.length-1);
src=dest;
return e;4.检查是否为空public boolean isEmpty(){
return src.length ==0;
}
}
转载请注明原文地址: https://ju.6miu.com/read-22674.html