用数组结构实现大小固定的队列和栈

public class Array_To_Stack_Queue {

    //使用数组结构实现栈
    public static class ArrayStack{
        private Integer[] arr;
        private int size;

        public ArrayStack(int initSize){
            if(initSize<0){
                throw new IllegalArgumentException("The init size is less than 0");
            }
            arr=new Integer[initSize];
            size=0;
        }

        public Integer peek(){
            if(size == 0)
                return null;
            return arr[size-1];
        }

        public void push(int obj){
            if (size==arr.length)
                throw new ArrayIndexOutOfBoundsException("The queue is full");
            arr[size++]=obj;
        }

        public Integer pop(){
            if(size == 0)
                throw new ArrayIndexOutOfBoundsException("The queue is empty");
            return arr[--size];
        }
    }


    //使用数组实现队列
    public static class ArrayQueue{

        private Integer[] arr;
        private Integer start;
        private Integer end;
        private Integer size;//size记录当前队列的大小，对start和end指针进行解耦

        public ArrayQueue(int initSize){
            if(initSize<0){
                throw new IllegalArgumentException("The init size is less than 0");
            }
            arr=new Integer[initSize];
            start=0;
            end=0;
            size=0;
        }

        public Integer peek(){
            if(size == 0){
                return null;
            }
            return arr[start];
        }

        public void push(int obj){
            if(size==arr.length){
                throw new ArrayIndexOutOfBoundsException("The queue is full");
            }
            size++;
            arr[end]=obj;
            end= end==arr.length-1?0:end+1;
        }

        public Integer poll(){
            if (size == 0) {
                throw new ArrayIndexOutOfBoundsException("The queue is empty");
            }
            size--;
            int temp=arr[start];
            start = start==arr.length-1?0:start+1;
            return temp;
        }
    }
}