一刷232

Author: diguage

README.adoc

@@ -1650,13 +1650,13 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Easy
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/implement-queue-using-stacks/[232. Implement Queue using Stacks^]
-//|{source_base_url}/_0232_ImplementQueueUsingStacks.java[Java]
-//|{doc_base_url}/0232-implement-queue-using-stacks.adoc[题解]
-//|Easy
-//|
-//
+|{counter:codes}
+|{leetcode_base_url}/implement-queue-using-stacks/[232. Implement Queue using Stacks^]
+|{source_base_url}/_0232_ImplementQueueUsingStacks.java[Java]
+|{doc_base_url}/0232-implement-queue-using-stacks.adoc[题解]
+|Easy
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/number-of-digit-one/[233. Number of Digit One^]
 //|{source_base_url}/_0233_NumberOfDigitOne.java[Java]

docs/0232-implement-queue-using-stacks.adoc

@@ -33,11 +33,32 @@ queue.empty(); // returns false
 * You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
 
 
-
+== 思路分析
 
 [[src-0232]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0232_ImplementQueueUsingStacks.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0232_ImplementQueueUsingStacks_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/implement-queue-using-stacks/solutions/2363977/232-yong-zhan-shi-xian-dui-lie-qing-xi-t-pi4l/?envType=study-plan-v2&envId=selected-coding-interview[232. 用栈实现队列 - 清晰图解^]
+
 

docs/index.adoc

@@ -538,7 +538,7 @@ include::0230-kth-smallest-element-in-a-bst.adoc[leveloffset=+1]
 
 include::0231-power-of-two.adoc[leveloffset=+1]
 
-// include::0232-implement-queue-using-stacks.adoc[leveloffset=+1]
+include::0232-implement-queue-using-stacks.adoc[leveloffset=+1]
 
 // include::0233-number-of-digit-one.adoc[leveloffset=+1]
 

logbook/202406.adoc

@@ -603,7 +603,12 @@
 |{counter:codes}
 |{leetcode_base_url}/merge-two-sorted-lists/[21. Merge Two Sorted Lists^]
 |{doc_base_url}/0021-merge-two-sorted-lists.adoc[题解]
-|递归
+|尝试递归解法
+
+|{counter:codes}
+|{leetcode_base_url}/implement-queue-using-stacks/[232. Implement Queue using Stacks^]
+|{doc_base_url}/0232-implement-queue-using-stacks.adoc[题解]
+|❎
 
 |===
 

src/main/java/com/diguage/algo/leetcode/_0232_ImplementQueueUsingStacks.java

@@ -0,0 +1,50 @@
+package com.diguage.algo.leetcode;
+
+import java.util.Deque;
+import java.util.LinkedList;
+
+public class _0232_ImplementQueueUsingStacks {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-15 21:11:15
+   */
+  class MyQueue {
+    Deque<Integer> inStack;
+    Deque<Integer> outStack;
+
+
+    public MyQueue() {
+      inStack = new LinkedList<>();
+      outStack = new LinkedList<>();
+    }
+
+    public void push(int x) {
+      inStack.push(x);
+    }
+
+    public int pop() {
+      int peek = peek();
+      outStack.pop();
+      return peek;
+    }
+
+    public int peek() {
+      if (!outStack.isEmpty()) {
+        return outStack.peek();
+      } else {
+        while (!inStack.isEmpty()) {
+          outStack.push(inStack.pop());
+        }
+      }
+      // TODO 这里， outStack 有可能是空啊？！
+      return outStack.peek();
+    }
+
+    public boolean empty() {
+      return inStack.isEmpty() && outStack.isEmpty();
+    }
+  }
+  // end::answer[]
+}