栈和队列

一、栈

1.实现栈

1.1用数组实现栈：

 public class MyStack <E>{
   
     private Object[] stack;
     private int size;
     public MyStack(){
   
         stack = new Object[10];//初始长度为10
    }
    //判断栈是否为空
    public boolean isEmpty(){
   
         return size==0;
    }
    //取得栈中最后一个元素
    public E peek(){
   
         if (isEmpty()){
   
             return null;
         }
         return (E)stack[size-1];
    }
    //出栈，返回出栈后的元素
    public E pop(){
   
         E e = peek();
         stack[size-1] = null;
         size--;
         return e;
    }
    public E push(E element){
   
         ensureCapacity(size);
         stack[size++] = element;
         return element;
    }
    //扩容
    public void ensureCapacity(int size){
   
         int len = stack.length;
         if (size>=len){
   
             int newlen = 10;
             stack = Arrays.copyOf(stack,len+newlen);
         }
    }

    public static void main(String[] args) {
   
        MyStack<Integer> myStack = new MyStack<>();
        myStack.push(1);
        myStack.push(3);
        myStack.push(4);
        myStack.push(8);
        myStack.push(6);
        myStack.push(3);
        myStack.push(7);
        myStack.push(0);
        myStack.push(4);
        myStack.push(3)<