Java-交替打印偶数和奇数

常见的一道面试题,认真想一想,自己写出来还是对wait()和notify()的理解有好处的,但是还是推荐使用reentrantlock去实现,更灵活吧。


package com.ilovewl.interview.concurrent;

/**
 * 主要就是两个线程占用同一把锁,一个标志位保存当前应该输出偶数还是奇数
 * @author liuchangrong
 */
public class PrintNumber {

  private static final int MAX_NUMBER = 10;

  public static void main(String[] args) {
    Counter lock = new Counter();
    new Thread(new A(lock)).start();
    new Thread(new B(lock)).start();
  }

  //输出偶数
  static class A implements Runnable {
    int init = 0;
    boolean flag = true;
    private Counter lock;

    public A(Counter lock) {
      this.lock = lock;
    }

    @Override
    public void run() {
      while (init <= MAX_NUMBER) {
        synchronized (lock) {
          if(!lock.odd) {
            try {
              lock.wait();
            } catch (InterruptedException e) {
              e.printStackTrace();
            }
          }
          System.out.println(init);
          try {
            Thread.sleep(1000);
          } catch (InterruptedException e) {
            e.printStackTrace();
          }
          init = init + 2;
          //通知另外一个进程
          lock.notifyAll();
          //改变下一个状态
          lock.odd = !lock.odd;
        }
      }
    }
  }

  //输出奇数
  static class B implements Runnable {
    int init = 1;
    private Counter lock;

    public B(Counter lock) {
      this.lock = lock;
    }

    @Override
    public void run() {
      while (init <= MAX_NUMBER ) {
        synchronized (lock) {
          if(lock.odd) {
            try {
              lock.wait();
            } catch (InterruptedException e) {
              e.printStackTrace();
            }
          }
          System.out.println(init);
          try {
            Thread.sleep(1000);
          } catch (InterruptedException e) {
            e.printStackTrace();
          }
          init = init + 2;
          lock.notifyAll();
          lock.odd = !lock.odd;
        }
      }
    }
  }
  static class Counter{
    //初始值为true,表示输出偶数,奇数的线程就等待
    //如果为false,表示输出奇数,偶数的线程就等待
    public boolean odd = true;
  }
}


使用ReentrantLock实现:

package com.ilovewl.interview.concurrent;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.ReentrantLock;

/**
 * 使用ReentrantLock打印奇数和偶数
 * @author liuchangrong
 */
public class PrintNumber2 {
  private static final int MAX_NUMBER = 10;
  static Counter lock = new Counter();
  static Condition a = lock.newCondition();
  static Condition b = lock.newCondition();
  public static void main(String[] args) {
    new Thread(new A(lock)).start();
    new Thread(new B(lock)).start();
  }

  //输出偶数
  static class A implements Runnable {
    int init = 0;
    private Counter lock;

    public A(Counter lock) {
      this.lock = lock;
    }

    @Override
    public void run() {
      while (init <= MAX_NUMBER) {
        lock.lock();
        try {
          if (!lock.odd) {
            try {
              a.await();
            } catch (InterruptedException e) {
              e.printStackTrace();
            }
          }
          System.out.println(init);
          try {
            Thread.sleep(1000);
          } catch (InterruptedException e) {
            e.printStackTrace();
          }
          init = init + 2;
          b.signal();
          lock.odd = !lock.odd;
        } finally {
          lock.unlock();
        }
      }
    }
  }

  //输出奇数
  static class B implements Runnable {
    int init = 1;
    private Counter lock;

    public B(Counter lock) {
      this.lock = lock;
    }

    @Override
    public void run() {
      while (init <= MAX_NUMBER ) {
        lock.lock();
        try {
          if (lock.odd) {
            try {
              b.await();
            } catch (InterruptedException e) {
              e.printStackTrace();
            }
          }
          System.out.println(init);
          try {
            Thread.sleep(1000);
          } catch (InterruptedException e) {
            e.printStackTrace();
          }
          init = init + 2;
          a.signal();
          lock.odd = !lock.odd;
        }finally {
          lock.unlock();
        }
      }
    }
  }
  static class Counter extends ReentrantLock {
    //初始值为true,表示先输出偶数,奇数的线程就等待
    public boolean odd = true;
    public Counter(){
      super(true);
    }
  }
}


如果有什么问题的话,欢迎留言讨论!

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值