按序打印

题目：
https://leetcode-cn.com/problems/print-in-order/submissions/
最经典的多线程问题。这里提供两种解决方案。

1. 原子计数器加while循环

class Foo {
private:
    std::atomic<int> counter_;
public:
    Foo() {
        counter_ = 0;
    }

    void first(function<void()> printFirst) {
        // printFirst() outputs "first". Do not change or remove this line.
        printFirst();
        counter_++;
    }

    void second(function<void()> printSecond) {
        while(counter_ != 1) {
        }
       // printSecond() outputs "second". Do not change or remove this line.
        printSecond();
        counter_++;
    }

    void third(function<void()> printThird) {
        while(counter_ != 2) {
        }
        // printThird() outputs "third". Do not change or remove this line.
        printThird();
    }
};

执行用时 :980 ms, 在所有 C++ 提交中击败了16.94%的用户。

这样的方法虽然通过了，但是while循环一直占着cpu，是个十分消耗资源的方法，不推荐。

2.用两个mutex控制顺序

class Foo {
private:
    std::mutex mux1_;
    std::mutex mux2_;
public:
    Foo() {
        mux1_.lock();
        mux2_.lock();
    }

    void first(function<void()> printFirst) {
        // printFirst() outputs "first". Do not change or remove this line.
        printFirst();
        mux1_.unlock();
    }

    void second(function<void()> printSecond) {
        mux1_.lock();
       // printSecond() outputs "second". Do not change or remove this line.
        printSecond();
        mux2_.unlock();
    }

    void third(function<void()> printThird) {
        mux2_.lock();
        // printThird() outputs "third". Do not change or remove this line.
        printThird();
        mux2_.unlock();
    }
};

执行用时 :60 ms, 在所有 C++ 提交中击败了36.05%的用户