-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfizzBuzz_leetcode.cpp
104 lines (81 loc) · 2.4 KB
/
fizzBuzz_leetcode.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
// https://leetcode.com/problems/fizz-buzz-multithreaded/description/
/**
Thread A: calls fizz() that should output the word "fizz".
Thread B: calls buzz() that should output the word "buzz".
Thread C: calls fizzbuzz() that should output the word "fizzbuzz".
Thread D: calls number() that should only output the integers.
"fizzbuzz" if i is divisible by 3 and 5,
"fizz" if i is divisible by 3 and not 5,
"buzz" if i is divisible by 5 and not 3, or
i if i is not divisible by 3 or 5.
*/
#include <mutex>
using namespace std;
class FizzBuzz {
mutex m;
condition_variable cv;
private:
int n;
int i;
public:
FizzBuzz(int n) {
this->n = n;
this->i = 1;
}
// printFizz() outputs "fizz".
void fizz(function<void()> printFizz) {
while (this->i <= this->n) {
unique_lock<mutex> lock(m);
while (this->i <= this-> n && ! (this->i % 3 == 0 && this->i % 5 != 0)) {
cv.wait(lock);
}
if (i <= n) {
printFizz();
++i;
}
cv.notify_all();
}
}
// printBuzz() outputs "buzz".
void buzz(function<void()> printBuzz) {
while (this->i <= this->n) {
unique_lock<mutex> lock(m);
while (this->i <= this-> n && ! (this->i % 5 == 0 && this->i % 3 != 0)) {
cv.wait(lock);
}
if (i <= n) {
printBuzz();
++i;
}
cv.notify_all();
}
}
// printFizzBuzz() outputs "fizzbuzz".
void fizzbuzz(function<void()> printFizzBuzz) {
while (this->i <= this->n) {
unique_lock<mutex> lock(m);
while (this->i <= this-> n && ! (this->i % 3 == 0 && this->i % 5 == 0)) {
cv.wait(lock);
}
if (i <= n) {
printFizzBuzz();
++i;
}
cv.notify_all();
}
}
// printNumber(x) outputs "x", where x is an integer.
void number(function<void(int)> printNumber) {
while (this->i <= this->n) {
unique_lock<mutex> lock(m);
while (this->i <= this-> n && ! (this->i % 3 != 0 && this->i % 5 != 0)) {
cv.wait(lock);
}
if (i <= n) {
printNumber(this->i);
++i;
}
cv.notify_all();
}
}
};