Skip to content

Commit 1c3f548

Browse files
diguagediguage
committed
调整目录结构
1 parent 420ea0a commit 1c3f548

13 files changed

+29
-17
lines changed

Diff for: ‎docs/0000-00-note.adoc

+3-3
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@ image::images/quick-sort-01.gif[{image_attr}]
103103
.. Daily Temperatures (easy)
104104
.. Remove All Adjacent Duplicates in String II (medium)
105105
.. Remove K Digits (hard)
106-
. Hash Maps
106+
. xref:0000-data-structure-map.adoc[Hash Maps]
107107
.. Introduction to Hash Tables
108108
.. Issues with Hash Tables
109109
.. Problem 1: First Non-repeating Character (easy)
@@ -191,14 +191,14 @@ image::images/quick-sort-01.gif[{image_attr}]
191191
.. Problem Challenge 1: Rearrange String K Distance Apart (hard)
192192
.. Problem Challenge 2: Scheduling Tasks (hard)
193193
.. Problem Challenge 3: Frequency Stack (hard)
194-
. xref:0000-25-greedy.adoc[Greedy Algorithms 贪心算法]
194+
. xref:0000-26-greedy.adoc[Greedy Algorithms 贪心算法]
195195
.. Valid Palindrome II (easy)
196196
.. Maximum Length of Pair Chain (medium)
197197
.. Minimum Add to Make Parentheses Valid (medium)
198198
.. Remove Duplicate Letters (medium)
199199
.. Largest Palindromic Number (medium)
200200
.. Removing Minimum and Maximum From Array (medium)
201-
. xref:0000-26-dynamic-programming.adoc[Dynamic Programming 动态规划]
201+
. xref:0000-27-dynamic-programming.adoc[Dynamic Programming 动态规划]
202202
.. 0/1 Knapsack (medium)
203203
.. Equal Subset Sum Partition (medium)
204204
.. Subset Sum (medium)

Diff for: ‎docs/0000-25-greedy.adoc renamed to ‎docs/0000-26-greedy.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[#0000-25-greedy]
1+
[#0000-26-greedy]
22
= Greedy Algorithms 贪心算法
33

44
== 经典例题

Diff for: ‎docs/0000-26-dp-1-0-1-knapsack.adoc renamed to ‎docs/0000-27-dp-1-0-1-knapsack.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[#0000-26-dp-1-0-1-knapsack]
1+
[#0000-27-dp-1-0-1-knapsack]
22
= 0/1 Knapsack 0/1 背包
33

44
image::images/dynamic-programming-knapsack.jpeg[{image_attr}]

Diff for: ‎docs/0000-26-dp-2-unbounded-knapsack.adoc renamed to ‎docs/0000-27-dp-2-unbounded-knapsack.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[#0000-26-dp-2-unbounded-knapsack]
1+
[#0000-27-dp-2-unbounded-knapsack]
22
= Unbounded Knapsack 无限背包
33

44

Diff for: ‎docs/0000-26-dp-3-fibonacci-numbers.adoc renamed to ‎docs/0000-27-dp-3-fibonacci-numbers.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[#0000-26-dp-3-fibonacci-numbers]
1+
[#0000-27-dp-3-fibonacci-numbers]
22
= Fibonacci Numbers 斐波那契数列
33

44

Diff for: ‎docs/0000-26-dp-4-palindromic-subsequence.adoc renamed to ‎docs/0000-27-dp-4-palindromic-subsequence.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[#0000-26-dp-4-palindromic-subsequence]
1+
[#0000-27-dp-4-palindromic-subsequence]
22
= Palindromic Subsequence 回文子系列
33

44

Diff for: ‎docs/0000-26-dp-5-longest-common-substring.adoc renamed to ‎docs/0000-27-dp-5-longest-common-substring.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[#0000-26-dp-5-longest-common-substring]
1+
[#0000-27-dp-5-longest-common-substring]
22
= Longest Common Substring 最长子字符串系列
33

44
== 经典题目

Diff for: ‎docs/0000-26-dynamic-programming.adoc renamed to ‎docs/0000-27-dynamic-programming.adoc

+5-5
Original file line numberDiff line numberDiff line change
@@ -593,15 +593,15 @@ image::images/dynamic-programming-01.jpeg[{image_attr}]
593593
. xref:3504-longest-palindrome-after-substring-concatenation-ii.adoc[3504. Longest Palindrome After Substring Concatenation II]
594594
. xref:3505-minimum-operations-to-make-elements-within-k-subarrays-equal.adoc[3505. Minimum Operations to Make Elements Within K Subarrays Equal]
595595

596-
include::0000-26-dp-1-0-1-knapsack.adoc[leveloffset=+1]
596+
include::0000-27-dp-1-0-1-knapsack.adoc[leveloffset=+1]
597597

598-
include::0000-26-dp-2-unbounded-knapsack.adoc[leveloffset=+1]
598+
include::0000-27-dp-2-unbounded-knapsack.adoc[leveloffset=+1]
599599

600-
include::0000-26-dp-3-fibonacci-numbers.adoc[leveloffset=+1]
600+
include::0000-27-dp-3-fibonacci-numbers.adoc[leveloffset=+1]
601601

602-
include::0000-26-dp-4-palindromic-subsequence.adoc[leveloffset=+1]
602+
include::0000-27-dp-4-palindromic-subsequence.adoc[leveloffset=+1]
603603

604-
include::0000-26-dp-5-longest-common-substring.adoc[leveloffset=+1]
604+
include::0000-27-dp-5-longest-common-substring.adoc[leveloffset=+1]
605605

606606
image::images/dynamic-programming-02.png[{image_attr}]
607607

Diff for: ‎docs/0000-data-structure-heap.adoc

+2
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
[#0000-data-structure-heap]
2+
= Heap 堆

Diff for: ‎docs/0000-data-structure-map.adoc

+2
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
[#0000-data-structure-map]
2+
= Map 映射

Diff for: ‎docs/0000-data-structure-queue.adoc

+2
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
[#0000-data-structure-queue]
2+
= Queue 队列

Diff for: ‎docs/0110-balanced-binary-tree.adoc

+1-1
Original file line numberDiff line numberDiff line change
@@ -96,7 +96,7 @@ include::{sourcedir}/_0110_BalancedBinaryTree_3.java[tag=answer]
9696
====
9797

9898

99-
树形 DP 解法参考了：xref:0000-26-dynamic-programming.adoc[动态规划] 中介绍的 “树形 DP 套路” 解法。
99+
树形 DP 解法参考了：xref:0000-27-dynamic-programming.adoc[动态规划] 中介绍的 “树形 DP 套路” 解法。
100100

101101
参考论坛中大家的讨论，可以在发现不平衡时，就及时返回，停止执行其他相关递归调用，起到“剪枝”的作用。同时，时间复杂度也可以做到最好。
102102

Diff for: ‎docs/index.adoc

+8-2
Original file line numberDiff line numberDiff line change
@@ -14,8 +14,14 @@ include::0000-data-structure-list.adoc[leveloffset=+1]
1414

1515
include::0000-data-structure-stack.adoc[leveloffset=+1]
1616

17+
include::0000-data-structure-queue.adoc[leveloffset=+1]
18+
19+
include::0000-data-structure-map.adoc[leveloffset=+1]
20+
1721
include::0000-data-structure-tree.adoc[leveloffset=+1]
1822

23+
include::0000-data-structure-heap.adoc[leveloffset=+1]
24+
1925
include::0000-data-structure-graph.adoc[leveloffset=+1]
2026

2127
// Pattern
@@ -72,9 +78,9 @@ include::0000-24-backtrack.adoc[leveloffset=+1]
7278

7379
include::0000-25-subsets.adoc[leveloffset=+1]
7480

75-
include::0000-25-greedy.adoc[leveloffset=+1]
81+
include::0000-26-greedy.adoc[leveloffset=+1]
7682

77-
include::0000-26-dynamic-programming.adoc[leveloffset=+1]
83+
include::0000-27-dynamic-programming.adoc[leveloffset=+1]
7884

7985
// :sectnums:
8086

0 commit comments

Comments
 (0)