diff --git a/docs/notes/Leetcode 题解 - 动态规划.md b/docs/notes/Leetcode 题解 - 动态规划.md
index 8a47c7ac..52cde651 100644
--- a/docs/notes/Leetcode 题解 - 动态规划.md
+++ b/docs/notes/Leetcode 题解 - 动态规划.md
@@ -976,7 +976,7 @@ public int combinationSum4(int[] nums, int target) {
题目描述：交易之后需要有一天的冷却时间。
- 
+ 
```java
public int maxProfit(int[] prices) {
@@ -1017,7 +1017,7 @@ The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
题目描述：每交易一次，都要支付一定的费用。
- 
+ 
```java
public int maxProfit(int[] prices, int fee) {
diff --git a/docs/notes/Leetcode 题解 - 搜索.md b/docs/notes/Leetcode 题解 - 搜索.md
index daee078f..cb38bf08 100644
--- a/docs/notes/Leetcode 题解 - 搜索.md
+++ b/docs/notes/Leetcode 题解 - 搜索.md
@@ -1214,11 +1214,12 @@ private int cubeNum(int i, int j) {
45 度对角线标记数组的长度为 2 \* n - 1，通过下图可以明确 (r, c) 的位置所在的数组下标为 r + c。
- 
+ 
+
135 度对角线标记数组的长度也是 2 \* n - 1，(r, c) 的位置所在的数组下标为 n - 1 - (r - c)。
- 
+ 
```java
private List> solutions;
diff --git a/docs/pics/1e2c588c-72b7-445e-aacb-d55dc8a88c29.png b/docs/pics/1e2c588c-72b7-445e-aacb-d55dc8a88c29.png
new file mode 100644
index 00000000..ec7475be
Binary files /dev/null and b/docs/pics/1e2c588c-72b7-445e-aacb-d55dc8a88c29.png differ
diff --git a/docs/pics/7a85e285-e152-4116-b6dc-3fab27ba9437.jpg b/docs/pics/7a85e285-e152-4116-b6dc-3fab27ba9437.jpg
new file mode 100644
index 00000000..dd261a1f
Binary files /dev/null and b/docs/pics/7a85e285-e152-4116-b6dc-3fab27ba9437.jpg differ
diff --git a/docs/pics/83acbb02-872a-4178-b22a-c89c3cb60263.jpg b/docs/pics/83acbb02-872a-4178-b22a-c89c3cb60263.jpg
new file mode 100644
index 00000000..5c5f250f
Binary files /dev/null and b/docs/pics/83acbb02-872a-4178-b22a-c89c3cb60263.jpg differ
diff --git a/docs/pics/9c422923-1447-4a3b-a4e1-97e663738187.jpg b/docs/pics/9c422923-1447-4a3b-a4e1-97e663738187.jpg
new file mode 100644
index 00000000..a57e7df1
Binary files /dev/null and b/docs/pics/9c422923-1447-4a3b-a4e1-97e663738187.jpg differ