1 Star 0 Fork 0

yuhang2__2/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
fizz-buzz-multithreaded.cpp 1.89 KB
一键复制 编辑 原始数据 按行查看 历史
// Time: O(n)
// Space: O(1)
class FizzBuzz {
public:
FizzBuzz(int n) : n_(n) {
}
// printFizz() outputs "fizz".
void fizz(function<void()> printFizz) {
for (int i = 1; i <= n_; ++i) {
{
unique_lock<mutex> l(m_);
cv_.wait(l, [this]() { return curr_ % 4 == 0; });
++curr_;
if (i % 3 == 0 && i % 5 != 0) {
printFizz();
}
}
cv_.notify_all();
}
}
// printBuzz() outputs "buzz".
void buzz(function<void()> printBuzz) {
for (int i = 1; i <= n_; ++i) {
{
unique_lock<mutex> l(m_);
cv_.wait(l, [this]() { return curr_ % 4 == 1; });
++curr_;
if (i % 3 != 0 && i % 5 == 0) {
printBuzz();
}
}
cv_.notify_all();
}
}
// printFizzBuzz() outputs "fizzbuzz".
void fizzbuzz(function<void()> printFizzBuzz) {
for (int i = 1; i <= n_; ++i) {
{
unique_lock<mutex> l(m_);
cv_.wait(l, [this]() { return curr_ % 4 == 2; });
++curr_;
if (i % 3 == 0 && i % 5 == 0) {
printFizzBuzz();
}
}
cv_.notify_all();
}
}
// printNumber(x) outputs "x", where x is an integer.
void number(function<void(int)> printNumber) {
for (int i = 1; i <= n_; ++i) {
{
unique_lock<mutex> l(m_);
cv_.wait(l, [this]() { return curr_ % 4 == 3; });
++curr_;
if (i % 3 != 0 && i % 5 != 0) {
printNumber(i);
}
}
cv_.notify_all();
}
}
private:
int n_;
int curr_ = 0;
mutex m_;
condition_variable cv_;
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/yuhang2__2/LeetCode-Solutions.git
git@gitee.com:yuhang2__2/LeetCode-Solutions.git
yuhang2__2
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助