数据结构与算法（二）用数组实现队列

public class ArrayQueue {

    int maxSize;//actual capacity is maxSize - 1, make an empty position as interval
    int front; // point to the first position
    int rear;//point to the position after the last position
    int[] array;

    public ArrayQueue(int maxSize){
        this.maxSize = maxSize;
        array = new int[maxSize];
    }

    public boolean isFull(){
        return (rear + 1) % maxSize == front;
    }

    public boolean isEmpty(){
        return rear == front;
    }

    public boolean offer(int num){
        if (isFull()){
            System.out.println("Queue is full.");
            return false;
        }
        array[rear] = num;
        rear++;
        return true;
    }

    public int poll(){
        if (isEmpty()){
            throw new RuntimeException("Queue is Empty.");
        }
        int value = array[front];
        front++;
        return value;
    }

    public int peek(){
        if (isEmpty()){
            throw new RuntimeException("Queue is Empty.");
        }
        return array[front];
    }

    public int size(){
        return (rear + maxSize - front) % maxSize;
    }

    public void printAll() {
        if (isEmpty()){
            System.out.println("[]");
            return;
        }
        StringBuffer sb = new StringBuffer();
        sb.append("[");
        for (int i = front; i < front + size(); i ++) {
            sb.append(array[i % maxSize]);
            sb.append(",");
        }
        sb.deleteCharAt(sb.lastIndexOf(","));
        sb.append("]");
        System.out.println(sb);
    }



    public static void main(String[] args) {
        ArrayQueue queue = new ArrayQueue(4);
        //add data
        queue.offer(1);
        queue.offer(2);
        queue.offer(3);
        queue.printAll();

        System.out.println("add to full queue.");
        if(!queue.offer(4)){
            System.out.println("success");
            queue.printAll();
        }

        System.out.println("peek from queue.");
        if(queue.peek()==1){
            System.out.println("success");
            queue.printAll();
        }

        System.out.println("get from queue");
        if(queue.poll()==1){
            System.out.println("success");
            queue.printAll();
        }

        System.out.println("add to queue");
        queue.offer(4);
        queue.printAll();

        queue.poll();
        queue.poll();
        queue.poll();
        System.out.println("get from empty queue");
        try {
            queue.poll();
        }catch (Exception e){
            System.out.println(e.getMessage());
        }

        queue.printAll();

    }
}