Leetcode_1188_设计有限阻塞队列_多线程

九幽孤翎

于 2021-03-23 19:27:25 发布

阅读量354

点赞数

CC 4.0 BY-SA版权

分类专栏：多线程 daily_algorithm 文章标签：多线程 leetcode

本文链接：https://blog.youkuaiyun.com/HDUCheater/article/details/115138590

daily_algorithm 同时被 2 个专栏收录

230 篇文章

订阅专栏

多线程

11 篇文章

订阅专栏

这个博客展示了如何使用Java实现一个基于`ReentrantLock`和`Condition`的有界阻塞队列BoundedBlockingQueue。队列容量可定制，支持`enqueue`和`dequeue`操作，遵循先进先出原则，当队列满或空时，操作会等待条件满足后再进行。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import java.util.LinkedList;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.ReentrantLock;
class BoundedBlockingQueue {

    private AtomicInteger size = new AtomicInteger(0);
    private static final ReentrantLock lock = new ReentrantLock();
    private final Condition isEmpty = lock.newCondition();
    private final Condition isFull = lock.newCondition();
    private final LinkedList<Integer> list = new LinkedList<Integer>();
    private final int capacity;
    public BoundedBlockingQueue(int capacity) {
        this.capacity = capacity;
    }

    public void enqueue(int element) throws InterruptedException {
        lock.lock();
        try {
            while (size.get() == capacity) {
                isFull.await();
            }
            list.addFirst(element);
            size.incrementAndGet();
            isEmpty.signal();
        } finally {
            lock.unlock();
        }
    }

    public int dequeue() throws InterruptedException {
        lock.lock();
        try{
            while(size.get() == 0){
                isEmpty.await();
            }
            int last = list.getLast();
            list.removeLast();
            size.decrementAndGet();
            isFull.signal();
            return last;
        } finally {
            lock.unlock();
        }
    }

    public int size() {
        return size.get();
    }
}