diff --git a/docs/notes/剑指 Offer 题解 - 3~9.md b/docs/notes/剑指 Offer 题解 - 3~9.md
index ecc5c2a1..bc870f6c 100644
--- a/docs/notes/剑指 Offer 题解 - 3~9.md
+++ b/docs/notes/剑指 Offer 题解 - 3~9.md
@@ -337,8 +337,7 @@ public TreeLinkNode GetNext(TreeLinkNode pNode) {
in 栈用来处理入栈（push）操作，out 栈用来处理出栈（pop）操作。一个元素进入 in 栈之后，出栈的顺序被反转。当元素要出栈时，需要先进入 out 栈，此时元素出栈顺序再一次被反转，因此出栈顺序就和最开始入栈顺序是相同的，先进入的元素先退出，这就是队列的顺序。
-
-
+
```java
Stack in = new Stack();
diff --git a/docs/pics/3ea280b5-be7d-471b-ac76-ff020384357c.gif b/docs/pics/3ea280b5-be7d-471b-ac76-ff020384357c.gif
new file mode 100644
index 00000000..4c8540a9
Binary files /dev/null and b/docs/pics/3ea280b5-be7d-471b-ac76-ff020384357c.gif differ
diff --git a/notes/pics/3ea280b5-be7d-471b-ac76-ff020384357c.gif b/notes/pics/3ea280b5-be7d-471b-ac76-ff020384357c.gif
new file mode 100644
index 00000000..4c8540a9
Binary files /dev/null and b/notes/pics/3ea280b5-be7d-471b-ac76-ff020384357c.gif differ
diff --git a/notes/剑指 Offer 题解 - 3~9.md b/notes/剑指 Offer 题解 - 3~9.md
index cf27ec2e..4de214cd 100644
--- a/notes/剑指 Offer 题解 - 3~9.md
+++ b/notes/剑指 Offer 题解 - 3~9.md
@@ -337,8 +337,7 @@ public TreeLinkNode GetNext(TreeLinkNode pNode) {
in 栈用来处理入栈（push）操作，out 栈用来处理出栈（pop）操作。一个元素进入 in 栈之后，出栈的顺序被反转。当元素要出栈时，需要先进入 out 栈，此时元素出栈顺序再一次被反转，因此出栈顺序就和最开始入栈顺序是相同的，先进入的元素先退出，这就是队列的顺序。
-
-
+
```java
Stack in = new Stack();
