https://leetcode.cn/problems/print-in-order/

Author: masx200

README.md

@@ -2582,4 +2582,6 @@ https://leetcode.cn/problems/split-a-circular-linked-list/
 
 https://leetcode.cn/problems/ipo
 
+https://leetcode.cn/problems/print-in-order/
+
 </details>

ipo/index.ixx

@@ -10,10 +10,9 @@ using std::priority_queue;
 using std::vector;
 namespace leetcode_test::ipo {
 export class Solution {
-public:
-    int findMaximizedCapital(int k, int w, vector<int>& profits,
-        vector<int>& capital)
-    {
+  public:
+    int findMaximizedCapital(int k, int w, vector<int> &profits,
+                             vector<int> &capital) {
         int n = profits.size();
         int curr = 0;
         priority_queue<int, vector<int>, less<int>> pq;
@@ -39,4 +38,4 @@ public:
         return w;
     }
 };
-}
+} // namespace leetcode_test::ipo

print-in-order/index.ixx

@@ -0,0 +1,39 @@
+module;
+#include <functional>
+#include <future>
+#include <thread>
+using std::function;
+using std::future;
+export module leetcode_test.print_in_order.Foo;
+namespace leetcode_test::print_in_order {
+export class Foo {
+  private:
+    std::promise<void> outpromise2;
+    std::promise<void> outpromise3;
+
+  public:
+    Foo() {}
+
+    void first(function<void()> printFirst) {
+
+        // printFirst() outputs "first". Do not change or remove this line.
+        printFirst();
+        outpromise2.set_value();
+    }
+
+    void second(function<void()> printSecond) {
+        future<void> fu = outpromise2.get_future();
+        fu.get();
+        // printSecond() outputs "second". Do not change or remove this line.
+        printSecond();
+        outpromise3.set_value();
+    }
+
+    void third(function<void()> printThird) {
+        future<void> fu = outpromise3.get_future();
+        fu.get();
+        // printThird() outputs "third". Do not change or remove this line.
+        printThird();
+    }
+};
+} // namespace leetcode_test::print_in_order