java 三个线程交替执行


package cn.itcast.gz;
 
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
/**
 * 第一个线程循环5次,接着第二个线程循环10次,
 * 接着第三个线程循环15次,然后又到第一个线程循环5次
 * 如此往复执行50次
 *
 */
public class Interview3 {
 
    public static void main(String[] args) {
 
        ThreadTest3 threadTest3 = new ThreadTest3();
 
        Thread t1 = new Thread(threadTest3);
        Thread t2 = new Thread(threadTest3);
        Thread t3 = new Thread(threadTest3);
 
         t1.start();
         t2.start();
         t3.start();
 
    }  
}
 
class ThreadTest3 implements Runnable
{
 
    private Lock lock = new ReentrantLock();
    private int j = 0;
    private int k = 1;
 
    Condition con1 = lock.newCondition();
    Condition con2 = lock.newCondition();
    Condition con3 = lock.newCondition();
 
    public void father()
    {
        lock.lock();
 
        try {          
            while(j!=0)
            con1.await();
            for(int i = 1;i<=5;i++)
            {
                System.out.println("Thread A..."+i);
            }
            j=(j+1)%3;
            con2.signal();
        catch (Exception e) {
            e.printStackTrace();
        }
        finally
        {
            lock.unlock();
        }
    }
 
    public void son()
    {
        lock.lock();
        try {
            while(j!=1)
            con2.await();
            for(int i = 1;i<=10;i++)
            {
                System.out.println("Thread B..."+i);
            }
            j=(j+1)%3;
            con3.signal();
        catch (Exception e) {
            e.printStackTrace();
        }
        finally
        {
            lock.unlock();
        }
    }
 
    public void granson()
    {
        lock.lock();
        try {
            while(j!=2)
            con3.await();
            for(int i = 1;i<=15;i++)
            {
                System.out.println("Thread C..."+i);
            }
            j=(j+1)%3;
            con1.signal();
        catch (Exception e) {
            e.printStackTrace();
        }
        finally
        {
            lock.unlock();
        }
    }
 
    @Override
    public void run() {
 
        for(int i = 0;i<3;i++)
        {
            if(k==1)
            {
               father();
               k=(k+1)%3;
            }
            else if(k==2)
             {
               son();
               k=(k+1)%3;
             }
            else
            {
              granson();
              k=(k+1)%3;
            }
        }
 
    /*  father();
        son();
        granson();*/
    }
}


评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值