2015年阿里面试题——多线程(生产者消费者模型)

题目:两个人,一个放苹果,一个人拿苹果。当苹果总数为5时,不能放苹果;当苹果总数为0时不能取。放苹果和取苹果两个过程为独立的过程。模拟该过程。

package apple;

public class TestApple {
    public static void main(String[] args) {
        Apple apple = new Apple();
        Thread tt =new TakeThread(apple);
        Thread pt = new PutThread(apple);

//      Thread tt2 =new TakeThread(apple);
//      Thread pt2 = new PutThread(apple);

        tt.start();
        pt.start();
//      tt2.start();
//      pt2.start();
    }
}

class Apple {
    private int number;  //初始苹果数
    private int Capacity; //容量

    public Apple() {
        this.number = 0;
        this.Capacity = 5;
    }
    public Apple(int number, int capacity) {
        this.number = number;
        this.Capacity = capacity;
    }

    public  synchronized void putApple(){
        while(number>=Capacity){
            try {
                wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        number++;
        System.out.println(number);
        notify();
    }

    public synchronized void takeApple(){
        while(number<=0){    //用while不用if
            try {
                wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        number--;
        System.out.println(number);
        notify();
    }
}

class TakeThread extends Thread {
    private Apple apple;

    public TakeThread(Apple apple) {
        this.apple = apple;
    }

    public void run() {
        while(true){
            try
            {
                Thread.sleep((long)(Math.random() * 1000));
            }
            catch (InterruptedException e)
            {
                e.printStackTrace();
            }
            apple.takeApple();      
        }
    }
}

 class PutThread extends Thread {

    private Apple apple;

    public PutThread(Apple apple) {
        this.apple = apple;
    }

    public void run() {
        while(true){
            try
            {
                Thread.sleep((long)(Math.random() * 1000));
            }
            catch (InterruptedException e)
            {
                e.printStackTrace();
            }
            apple.putApple();   
        }
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值