[377. Combination Sum IV (Medium)](https://leetcode.com/problems/combination-sum-iv/description/)
...
...
@@ -971,7 +968,7 @@ public int combinationSum4(int[] nums, int target) {
# 股票交易
## 需要冷却期的股票交易
## 1. 需要冷却期的股票交易
[309. Best Time to Buy and Sell Stock with Cooldown(Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/)
...
...
@@ -1002,7 +999,7 @@ public int maxProfit(int[] prices) {
}
```
## 需要交易费用的股票交易
## 2. 需要交易费用的股票交易
[714. Best Time to Buy and Sell Stock with Transaction Fee (Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/)
...
...
@@ -1041,7 +1038,7 @@ public int maxProfit(int[] prices, int fee) {
```
## 只能进行两次的股票交易
## 3. 只能进行两次的股票交易
[123. Best Time to Buy and Sell Stock III (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/)
...
...
@@ -1067,7 +1064,7 @@ public int maxProfit(int[] prices) {
}
```
## 只能进行 k 次的股票交易
## 4. 只能进行 k 次的股票交易
[188. Best Time to Buy and Sell Stock IV (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/)
...
...
@@ -1097,7 +1094,7 @@ public int maxProfit(int k, int[] prices) {
# 字符串编辑
## 删除两个字符串的字符使它们相等
## 1. 删除两个字符串的字符使它们相等
[583. Delete Operation for Two Strings (Medium)](https://leetcode.com/problems/delete-operation-for-two-strings/description/)
...
...
@@ -1126,7 +1123,7 @@ public int minDistance(String word1, String word2) {
[377. Combination Sum IV (Medium)](https://leetcode.com/problems/combination-sum-iv/description/)
...
...
@@ -971,7 +968,7 @@ public int combinationSum4(int[] nums, int target) {
# 股票交易
## 需要冷却期的股票交易
## 1. 需要冷却期的股票交易
[309. Best Time to Buy and Sell Stock with Cooldown(Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/)
...
...
@@ -1002,7 +999,7 @@ public int maxProfit(int[] prices) {
}
```
## 需要交易费用的股票交易
## 2. 需要交易费用的股票交易
[714. Best Time to Buy and Sell Stock with Transaction Fee (Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/)
...
...
@@ -1041,7 +1038,7 @@ public int maxProfit(int[] prices, int fee) {
```
## 只能进行两次的股票交易
## 3. 只能进行两次的股票交易
[123. Best Time to Buy and Sell Stock III (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/)
...
...
@@ -1067,7 +1064,7 @@ public int maxProfit(int[] prices) {
}
```
## 只能进行 k 次的股票交易
## 4. 只能进行 k 次的股票交易
[188. Best Time to Buy and Sell Stock IV (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/)
...
...
@@ -1097,7 +1094,7 @@ public int maxProfit(int k, int[] prices) {
# 字符串编辑
## 删除两个字符串的字符使它们相等
## 1. 删除两个字符串的字符使它们相等
[583. Delete Operation for Two Strings (Medium)](https://leetcode.com/problems/delete-operation-for-two-strings/description/)
...
...
@@ -1126,7 +1123,7 @@ public int minDistance(String word1, String word2) {