Skip to content

Commit bd5cd4d

Browse files
committed
readme updated.
1 parent ef6d34c commit bd5cd4d

File tree

1 file changed

+4
-3
lines changed

1 file changed

+4
-3
lines changed

readme.md

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -136,7 +136,7 @@
136136
| 3-5 三路快排partition思路的应用 Sort Color | 75 | 88 215 | | |
137137
| 3-6 对撞指针 Two Sum II - Input Array is Sorted | 167 | 125 344 345 11 | | |
138138
| 3-7 滑动窗口 Minimum Size Subarray Sum | 209 3 | 438 76 | 713 | |
139-
| 补充1:更多数组中的问题 | [] | [] | 303 121 122 717 674 268 | 123 |
139+
| 补充1:更多数组中的问题 | [] | [] | 303 121 122 717 674 268 727 | 123 |
140140
| 补充2:字符数组(字符串) | [] | [] | 434 387 696 443 | |
141141
| 补充3:二维数组中的问题 | [] | [] | 598 723 | |
142142
| **第四章 查找表相关问题** | | | | |
@@ -156,7 +156,8 @@
156156
| 5-4 复杂的穿针引线 Swap Nodes in Pairs | 24 | 25 147 148 | | |
157157
| 5-5 不仅仅是穿针引线 Delete Node in a Linked List | 237 | [] | | |
158158
| 5-6 链表与双指针 Remove Nth Node Form End of List | 19 | 61 143 234 | | |
159-
| 补充1:Floyd环检测算法| [] | [] | 141 142 | 287 |
159+
| 补充1:更多链表中的问题 | [] | [] | 725 | |
160+
| 补充2:Floyd环检测算法 | [] | [] | 141 142 | 287 |
160161
| **第六章 栈、队列、优先队列** | | | | |
161162
| 6-1 栈的基础应用 Valid Parentheses | 20 | 150 71 | | |
162163
| 6-2 栈和递归的紧密关系 Binary Tree Preorder, Inorder and Postorder Traversal | 144 94 145 | [] | | |
@@ -193,7 +194,7 @@
193194
| 9-8 LIS问题 Longest Increasing Subsequence | 300 | 376 | 673 | |
194195
| 9-9 LCS,最短路,求动态规划的具体解以及更多 | [] | [] | 583 712 718 | |
195196
| 补充1:状态压缩DP | [] | [] | 698 | |
196-
| 补充2:更多动态规划问题 | | | 188 | |
197+
| 补充2:更多动态规划问题 | | | 188 | 727 |
197198
| **第十章 贪心算法** | | | | |
198199
| 10-1 贪心基础 Assign Cookies | 455 | 392 | | |
199200
| 10-2 贪心算法与动态规划的关系 Non-overlapping Intervals | 435 | [] | | |

0 commit comments

Comments
 (0)