Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 376bac2

Browse files
update content
1 parent b9f49d6 commit 376bac2

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

60 files changed

+98
-98
lines changed

‎动态规划系列/LCS.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ int longestCommonSubsequence(String s1, String s2);
5252

5353

5454
<hr>
55-
<details>
55+
<detailsclass="hint-container details">
5656
<summary><strong>引用本文的文章</strong></summary>
5757

5858
- [动态规划之子序列问题解题模板](https://labuladong.github.io/article/fname.html?fname=子序列问题模板)
@@ -64,7 +64,7 @@ int longestCommonSubsequence(String s1, String s2);
6464

6565

6666
<hr>
67-
<details>
67+
<detailsclass="hint-container details">
6868
<summary><strong>引用本文的题目</strong></summary>
6969

7070
<strong>安装 [我的 Chrome 刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) 点开下列题目可直接查看解题思路:</strong>

‎动态规划系列/动态规划之KMP字符匹配算法.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -429,7 +429,7 @@ KMP 算法也就是动态规划那点事,我们的公众号文章目录有一
429429

430430

431431
<hr>
432-
<details>
432+
<detailsclass="hint-container details">
433433
<summary><strong>引用本文的文章</strong></summary>
434434

435435
- [我的刷题心得](https://labuladong.github.io/article/fname.html?fname=算法心得)

‎动态规划系列/动态规划之博弈问题.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -235,7 +235,7 @@ int stoneGame(int[] piles) {
235235

236236

237237
<hr>
238-
<details>
238+
<detailsclass="hint-container details">
239239
<summary><strong>引用本文的文章</strong></summary>
240240

241241
- [贪心算法之区间调度问题](https://labuladong.github.io/article/fname.html?fname=贪心算法之区间调度问题)

‎动态规划系列/动态规划之四键键盘.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -220,7 +220,7 @@ def dp(n, a_num, copy):
220220

221221

222222
<hr>
223-
<details>
223+
<detailsclass="hint-container details">
224224
<summary><strong>引用本文的文章</strong></summary>
225225

226226
- [一个方法团灭 LeetCode 打家劫舍问题](https://labuladong.github.io/article/fname.html?fname=抢房子)

‎动态规划系列/动态规划之正则表达.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -118,7 +118,7 @@ bool dp(string& s, int i, string& p, int j);
118118
119119
120120
<hr>
121-
<details>
121+
<details>
122122
<summary><strong>引用本文的文章</strong></summary>
123123
124124
- [最优子结构原理和 dp 数组遍历方向](https://labuladong.github.io/article/fname.html?fname=最优子结构)
@@ -130,7 +130,7 @@ bool dp(string& s, int i, string& p, int j);
130130
131131
132132
<hr>
133-
<details>
133+
<details class="hint-container details">
134134
<summary><strong>引用本文的题目</strong></summary>
135135
136136
<strong>安装 [我的 Chrome 刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) 点开下列题目可直接查看解题思路:</strong>

‎动态规划系列/动态规划设计:最长递增子序列.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -303,7 +303,7 @@ int lengthOfLIS(int[] nums) {
303303

304304

305305
<hr>
306-
<details>
306+
<detailsclass="hint-container details">
307307
<summary><strong>引用本文的文章</strong></summary>
308308

309309
- [二分查找高效判定子序列](https://labuladong.github.io/article/fname.html?fname=二分查找判定子序列)
@@ -320,7 +320,7 @@ int lengthOfLIS(int[] nums) {
320320

321321

322322
<hr>
323-
<details>
323+
<detailsclass="hint-container details">
324324
<summary><strong>引用本文的题目</strong></summary>
325325

326326
<strong>安装 [我的 Chrome 刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) 点开下列题目可直接查看解题思路:</strong>

‎动态规划系列/动态规划详解进阶.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -451,7 +451,7 @@ int coinChange(int[] coins, int amount) {
451451

452452

453453
<hr>
454-
<details>
454+
<detailsclass="hint-container details">
455455
<summary><strong>引用本文的文章</strong></summary>
456456

457457
- [Dijkstra 算法模板及应用](https://labuladong.github.io/article/fname.html?fname=dijkstra算法)
@@ -491,7 +491,7 @@ int coinChange(int[] coins, int amount) {
491491

492492

493493
<hr>
494-
<details>
494+
<detailsclass="hint-container details">
495495
<summary><strong>引用本文的题目</strong></summary>
496496

497497
<strong>安装 [我的 Chrome 刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) 点开下列题目可直接查看解题思路:</strong>

‎动态规划系列/团灭股票问题.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -695,7 +695,7 @@ int maxProfit_k_inf(int[] prices, int cooldown, int fee) {
695695

696696

697697
<hr>
698-
<details>
698+
<detailsclass="hint-container details">
699699
<summary><strong>引用本文的文章</strong></summary>
700700

701701
- [最优子结构原理和 dp 数组遍历方向](https://labuladong.github.io/article/fname.html?fname=最优子结构)
@@ -707,7 +707,7 @@ int maxProfit_k_inf(int[] prices, int cooldown, int fee) {
707707

708708

709709
<hr>
710-
<details>
710+
<detailsclass="hint-container details">
711711
<summary><strong>引用本文的题目</strong></summary>
712712

713713
<strong>安装 [我的 Chrome 刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) 点开下列题目可直接查看解题思路:</strong>

‎动态规划系列/子序列问题模板.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@
3939

4040

4141
<hr>
42-
<details>
42+
<detailsclass="hint-container details">
4343
<summary><strong>引用本文的文章</strong></summary>
4444

4545
- [动态规划设计:最长递增子序列](https://labuladong.github.io/article/fname.html?fname=动态规划设计:最长递增子序列)

‎动态规划系列/抢房子.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ int rob(int[] nums);
5252

5353

5454
<hr>
55-
<details>
55+
<detailsclass="hint-container details">
5656
<summary><strong>引用本文的题目</strong></summary>
5757

5858
<strong>安装 [我的 Chrome 刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) 点开下列题目可直接查看解题思路:</strong>

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /