用多线程线程实现abc顺序打印

思路,锁住资源,判断条件

方案一

package com.qst.Tesst;

import java.util.Scanner;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.FutureTask;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
/*
* 用线程实现ABC顺序打印
* 
*
* */

public class Test14  {
    private static int state = 0;
    public static void main(String[] args) {

        final Lock l = new ReentrantLock();
        ExecutorService executorService = Executors.newFixedThreadPool(3);
        executorService.submit(new Runnable() {
            @Override
            public void run() {
                while (true) {
                    synchronized (this){
                   if (state % 3 == 0) {
                        System.out.println("A"+ "====="+Thread.currentThread().getName());
                        state++;
                    }
                    }
                }
              }
            });
        executorService.submit(new Runnable() {
            @Override
            public void run() {
                while (true) {
                    synchronized (this) {
                        if (state % 3 == 1) {
                            System.out.println("B" + "====="+Thread.currentThread().getName());
                            state++;
                        }
                    }
                }
            }
        });
        executorService.submit(new Runnable() {
            @Override
            public void run() {
                while (true) {
                    synchronized (this) {
                        if (state % 3 == 2) {
                            System.out.println("C"+ "=====" + Thread.currentThread().getName());
                            state++;
                        }
                    }
                }
            }
        });


    }


}


方案二


package com.qst.Tesst;

import java.util.Scanner;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.FutureTask;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;


public class Test14  {
    private static int state = 0;
    public static void main(String[] args) {

        final Lock l = new ReentrantLock();
        ExecutorService executorService = Executors.newFixedThreadPool(3);
        executorService.submit(new Runnable() {
            @Override
            public void run() {
                while (true) {
                    l.lock();
                    if (state % 3 == 0) {
                        System.out.println("A"+"=====>"+Thread.currentThread().getName());
                        state++;
                    }
                    l.unlock();
                }
              }
            });
        executorService.submit(new Runnable() {
            @Override
            public void run() {
                while (true) {
                    l.lock();
                    if (state % 3 == 1) {
                        System.out.println("B"+"=====>"+Thread.currentThread().getName());
                        state++;
                    }
                    l.unlock();
                }
            }
        });
        executorService.submit(new Runnable() {
            @Override
            public void run() {
                while (true) {
                    l.lock();
                    if (state % 3 == 2) {
                        System.out.println("C"+"=====>"+Thread.currentThread().getName());
                        state++;
                    }
                    l.unlock();
                }
            }
        });


    }


}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值