一道java的基礎題：一個線程安全的後進先出隊列

要求：編寫一個後進先出隊列，用於存放整數，實現其線程安全

一、隊列代碼：

public class Queue {
    int max = 1000;
    int[] queue = new int[max];
    int cusor = -1;

    public synchronized Integer get() {
        while (cusor < 0) {
            //返回出錯
            try {
                System.out.println("get wait");
                wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }

        }

        --cusor;
        int data = queue[cusor + 1];
        notifyAll();
        return data;

    }

    public synchronized int put(int data) {
        while (cusor >= max - 1) {
            //返回出錯
            try {
                System.out.println("put wait");
                wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }

        ++cusor;
        queue[cusor] = data;
        notifyAll();
        return data;

    }
}

二、測試代碼：

public class Producer extends Thread {
    Queue queue;

    public Producer(Queue queue) {
        this.queue = queue;
    }

    @Override
    public void run() {
        for (int i = 0; i < 100000; i++) {
            System.out.println("put " + queue.put(i));
        }
    }

}

class Consumer extends Thread {
    Queue queue;

    public Consumer(Queue queue) {
        this.queue = queue;
    }

    @Override
    public void run() {
        for (int i = 0; i < 100000; i++) {
            System.out.println("get  " + queue.get());
        }
    }
}

class PCTest {
    public static void main(String[] args) {
        Queue queue1 = new Queue();
        Producer producer = new Producer(queue1);
        Consumer consumer = new Consumer(queue1);

        producer.start();
        consumer.start();
    }
}