两个线程交替打印1-100

一、实现方案

  • 使用ReentrantLock
  • synchronized同步锁

二、ReentrantLock实现

public class Test {
    private static int maxCount = 100;
    private static volatile int num = 1;
    private static Lock lock = new ReentrantLock();
    private static Condition oddCondition = lock.newCondition();
    private static Condition evenCondition = lock.newCondition();

    public static void main(String[] args) {
        Thread oddThread = new Thread(() -> {
            printOdd();
        }, "OddThread");

        Thread evenThread = new Thread(() -> {
            printEven();
        }, "EvenThread");

        oddThread.start();
        evenThread.start();
    }

    private static void printOdd() {
        while (num <= maxCount) {
            try {
                lock.lock();
                if (num % 2 != 0) {
                    System.out.println("printOdd " + num);
                    num++;
                }
                evenCondition.signal();
                oddCondition.await();
            } catch (InterruptedException e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }

    }

    private static void printEven() {
        while (num <= maxCount) {
            try {
                lock.lock();
                if (num % 2 == 0) {
                    System.out.println("printEven " + num);
                    num++;
                }
                oddCondition.signal();
                evenCondition.await();
            } catch (InterruptedException e) {
                e.printStackTrace();
            } finally {
                lock.unlock();
            }
        }
    }
}
public class Test {

    public volatile static int count = 1;

    public static void main(String[] args) throws Exception {
        System.out.println("start....");
        ReentrantLock lock = new ReentrantLock();
        Condition condition1 = lock.newCondition();
        Condition condition2 = lock.newCondition();
        Condition condition3 = lock.newCondition();

        new Thread(() -> {
            while (count < 100) {
                try {
                    lock.lock();

                    if (count % 3 == 1) {
                        System.out.println("threadA:" + count);
                        count++;
                        condition2.signal();
                        condition1.await();
                    }
                } catch (Exception e) {
                    e.printStackTrace();
                } finally {
                    lock.unlock();
                }
            }

        }, "threadA").start();

        new Thread(() -> {
            while (count < 100) {
                try {
                    lock.lock();

                    if (count % 3 == 2) {
                        System.out.println("threadB:" + count);
                        count++;
                        condition3.signal();
                        condition2.await();
                    }

                } catch (Exception e) {
                    e.printStackTrace();
                } finally {
                    lock.unlock();
                }
            }

        }, "threadB").start();

        new Thread(() -> {
            while (count < 100) {
                try {
                    lock.lock();

                    if (count % 3 == 0) {
                        System.out.println("threadC:" + count);
                        count++;
                        condition1.signal();
                        condition3.await();
                    }
                } catch (Exception e) {
                    e.printStackTrace();
                } finally {
                    lock.unlock();
                }
            }

        }, "threadC").start();
    }
}

三、synchronized同步锁

public class Test {
    private static int maxCount = 100;
    private static int num = 1;
    private static Object lock = new Object();

    public static void main(String[] args) {
        Thread oddThread = new Thread(() -> {
            printOdd();
        }, "OddThread");

        Thread evenThread = new Thread(() -> {
            printEven();
        }, "EvenThread");

        oddThread.start();
        evenThread.start();
    }

    private static void printOdd() {
        while (num <= maxCount) {
            try {
                synchronized (lock) {
                    if (num % 2 != 0) {
                        System.out.println("printOdd " + num);
                        num++;
                        lock.notify();
                        lock.wait();
                    }
                }
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }

    }

    private static void printEven() {
        while (num <= maxCount) {
            try {
                synchronized (lock) {
                    if (num % 2 == 0) {
                        System.out.println("printEven " + num);
                        num++;
                        lock.notify();
                        lock.wait();
                    }
                }
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值