LeetCode1115: 交替打印FooBar
题目描述
我们提供一个类:
class FooBar {
public void foo() {
for (int i = 0; i < n; i++) {
print("foo");
}
}
public void bar() {
for (int i = 0; i < n; i++) {
print("bar");
}
}
}
两个不同的线程将会共用一个 FooBar 实例。其中一个线程将会调用 foo() 方法,另一个线程将会调用 bar() 方法。
请设计修改程序,以确保 “foobar” 被输出 n 次。
样例
示例 1:
输入: n = 1
输出: "foobar"
解释: 这里有两个线程被异步启动。其中一个调用 foo() 方法, 另一个调用 bar() 方法,"foobar" 将被输出一次。
示例 2:
输入: n = 2
输出: "foobarfoobar"
解释: "foobar" 将被输出两
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/print-foobar-alternately
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题
way1 atomic_flag
class FooBar {
private:
int n;
std::atomic_flag lock1{ATOMIC_FLAG_INIT};
std::atomic_flag lock2{ATOMIC_FLAG_INIT};
bool init_{false};
public:
FooBar(int n) {
this->n = n;
}
void foo(function<void()> printFoo) {
for (int i = 0; i < n; i++) {
while (lock1.test_and_set(std::memory_order_acquire))
this_thread::yield();
// printFoo() outputs "foo". Do not change or remove this line.
printFoo();
lock2.clear();
init_ = true;
}
}
void bar(function<void()> printBar) {
for (int i = 0; i < n; i++) {
while (!init_ || lock2.test_and_set(std::memory_order_acquire))
this_thread::yield();
// printBar() outputs "bar". Do not change or remove this line.
printBar();
lock1.clear();
init_ = false;
}
}
};
way2 atomic
class FooBar {
private:
int n;
atomic<bool> flag = false;
public:
FooBar(int n) {
this->n = n;
}
void foo(function<void()> printFoo) {
for (int i = 0; i < n; i++) {
while (flag)
this_thread::yield();
// printFoo() outputs "foo". Do not change or remove this line.
printFoo();
flag = true;
}
}
void bar(function<void()> printBar) {
for (int i = 0; i < n; i++) {
while (!flag)
this_thread::yield();
// printBar() outputs "bar". Do not change or remove this line.
printBar();
flag = false;
}
}
};
way3 通过mutex和condition_variable来实现
class FooBar {
private:
int n;
bool flag_ = false;
mutex mutex_;
condition_variable cv_;
public:
FooBar(int n) {
this->n = n;
}
void foo(function<void()> printFoo) {
unique_lock<mutex> lk(mutex_);
for (int i = 0; i < n; i++) {
cv_.wait(lk,[this](){return flag_ == false;});
printFoo();
flag_ = true;
cv_.notify_all();
}
}
void bar(function<void()> printBar) {
unique_lock<mutex> lk(mutex_);
for (int i = 0; i < n; i++) {
cv_.wait(lk,[this](){return flag_ == true;}) ;
// printBar() outputs "bar". Do not change or remove this line.
printBar();
flag_ = false;
cv_.notify_all();
}
}
};
way4 信号量
#include <semaphore.h>
class FooBar {
private:
int n;
sem_t sem1;
sem_t sem2;
public:
FooBar(int n) {
this->n = n;
sem_init(&sem1, 0, 0);
sem_init(&sem2, 0, 1);
}
void foo(function<void()> printFoo) {
for (int i = 0; i < n; i++) {
sem_wait(&sem2);
// printFoo() outputs "foo". Do not change or remove this line.
printFoo();
sem_post(&sem1);
}
}
void bar(function<void()> printBar) {
for (int i = 0; i < n; i++) {
sem_wait(&sem1);
// printBar() outputs "bar". Do not change or remove this line.
printBar();
sem_post(&sem2);
}
}
};