diff --git a/docs/notes/剑指 Offer 题解 - 60~68.md b/docs/notes/剑指 Offer 题解 - 60~68.md
index 41ae9fa3..570de06f 100644
--- a/docs/notes/剑指 Offer 题解 - 60~68.md
+++ b/docs/notes/剑指 Offer 题解 - 60~68.md
@@ -40,7 +40,7 @@
把 n 个骰子仍在地上，求点数和为 s 的概率。
- 
+ 
## 解题思路
@@ -113,7 +113,8 @@ public List> dicesSum(int n) {
五张牌，其中大小鬼为癞子，牌面大小为 0。判断这五张牌是否能组成顺子。
-
+
+
## 解题思路
@@ -172,7 +173,7 @@ public int LastRemaining_Solution(int n, int m) {
可以有一次买入和一次卖出，那么买入必须在前。求最大收益。
-
+
## 解题思路
@@ -244,7 +245,8 @@ public int Add(int a, int b) {
给定一个数组 A[0, 1,..., n-1]，请构建一个数组 B[0, 1,..., n-1]，其中 B 中的元素 B[i]=A[0]\*A[1]\*...\*A[i-1]\*A[i+1]\*...\*A[n-1]。要求不能使用除法。
-
+
+
## 解题思路
diff --git a/docs/pics/195f8693-5ec4-4987-8560-f25e365879dd.png b/docs/pics/195f8693-5ec4-4987-8560-f25e365879dd.png
new file mode 100644
index 00000000..e22e0f60
Binary files /dev/null and b/docs/pics/195f8693-5ec4-4987-8560-f25e365879dd.png differ
diff --git a/docs/pics/4240a69f-4d51-4d16-b797-2dfe110f30bd.png b/docs/pics/4240a69f-4d51-4d16-b797-2dfe110f30bd.png
new file mode 100644
index 00000000..985e3380
Binary files /dev/null and b/docs/pics/4240a69f-4d51-4d16-b797-2dfe110f30bd.png differ
diff --git a/docs/pics/42661013-750f-420b-b3c1-437e9a11fb65.png b/docs/pics/42661013-750f-420b-b3c1-437e9a11fb65.png
new file mode 100644
index 00000000..39a835a4
Binary files /dev/null and b/docs/pics/42661013-750f-420b-b3c1-437e9a11fb65.png differ
diff --git a/docs/pics/eaa506b6-0747-4bee-81f8-3cda795d8154.png b/docs/pics/eaa506b6-0747-4bee-81f8-3cda795d8154.png
new file mode 100644
index 00000000..24eed871
Binary files /dev/null and b/docs/pics/eaa506b6-0747-4bee-81f8-3cda795d8154.png differ
