剑指 Offer 59 - II. 队列的最大值

include/jianzhi_offer.h

@@ -2,6 +2,7 @@
 
 #include <iostream>
 #include <string>
+#include <queue>
 #include <stack>
 
 namespace yaha {
@@ -115,6 +116,23 @@ private:
     std::stack<int> _min_stk;
 };
 
+/**
+ * 剑指 Offer 59 - II. 队列的最大值
+ *
+ * @url: https://leetcode.cn/leetbook/read/illustration-of-algorithm/e2t5ug/
+ */
+class MaxQueue {
+public:
+    MaxQueue() = default;
+    int max();
+    void push(int value);
+    int pop();
+
+private:
+    std::queue<int> _que;
+    std::deque<int> _max_queue;
+};
+
 /**
  * 剑指 Offer 59 - I. 滑动窗口的最大值
  *