LeetCode解题之十七:循环打印ABC

package com.mf.module.leetcode;

import java.util.concurrent.locks.Condition;

import java.util.concurrent.locks.ReentrantLock;

/**

  • @Auther: mufeng

  • @Date: 2020/8/15 20:41

  • @Version: V 1.0.0

  • @Description: Three threads print

*/

public class NThreadPrint {

private static ReentrantLock lock = new ReentrantLock();

private static Condition condition1 = lock.newCondition();

private static Condition condition2 = lock.newCondition();

private static Condition condition3 = lock.newCondition();

private static int count = 0;

public static void main(String[] args) {

Thread t1 = new Thread(thread1);

Thread t2 = new Thread(thread2);

Thread t3 = new Thread(thread3);

t1.start();

t2.start();

t3.start();

}

private static Runnable thread1 = () -> {

for (int i = 0 ; i < 3 ; i ++){

try {

lock.lock();

if (count % 3 != 0) {

condition1.await();

}

System.out.println(“A”);

count++;

condition2.signal();

} catch (Exception e) {

e.printStackTrace();

}finally {

lock.unlock();

}

}

};

private static Runnable thread2 = () -> {

for (int i = 0 ; i < 3 ; i ++){

try {

lock.lock();

if (count % 3 != 1) {

condition2.await();

}

System.out.println(“B”);

count++;

condition3.signal();

} catch (Exception e) {

e.printStackTrace();

}finally {

lock.unlock();

}

}

};

private static Runnable thread3 = () -> {

for (int i = 0 ; i < 3 ; i ++){

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值