Skip to content

Commit a5d0075

Browse files
labuladonglabuladong
committed
adjust number of chapter
1 parent f1b2365 commit a5d0075

File tree

2 files changed

+71
-71
lines changed

2 files changed

+71
-71
lines changed

‎README.md

Lines changed: 36 additions & 36 deletions
Original file line numberDiff line numberDiff line change
@@ -15,25 +15,22 @@ This command specifies the `english` branch and limit the depth of clone, get ri
1515

1616
# Table of Content
1717

18-
* I. High Frequency Interview Problem
19-
* [How to Implement LRU Cache](interview/LRU_algorithm.md)
20-
* [How to Find Prime Number Efficiently](interview/Print_PrimeNumbers.md)
21-
* [How to Calculate Minimium Edit Distance](dynamic_programming/EditDistance.md)
22-
* [How to Solve Drop Water Problem](interview/Trapping_Rain_Water.md)
23-
* [How to Remove Duplicate From Sorted Sequence](interview/RemoveDuplicatesfromSortedArray.md)
24-
* [How to Find Longest Palindromic Substring](interview/TheLongestPalindromicSubstring.md)
25-
* [How to Reverse Linked List in K Group](interview/reverse-nodes-in-k-group.md)
26-
* [How to Check the Validation of Parenthesis](interview/valid-parentheses.md)
27-
* [How to Find Missing Element](interview/missing_elements.md)
28-
* [How to Pick Elements From a Arbitrary Sequence](interview/ReservoirSampling.md)
29-
* [How to use Binary Search](interview/UsingBinarySearchAlgorithm.md)
30-
* [How to Scheduling Seats](interview/Seatscheduling.md)
31-
* [Union-Find Algorithm in Detail](think_like_computer/Union-find-Explanation.md)
32-
* [Union-Find Application](think_like_computer/Union-Find-Application.md)
33-
* [Find Sebesquence With Binary Search](interview/findSebesquenceWithBinarySearch.md)
34-
* [Problems can be sloved by one line](interview/one-line-code-puzzles.md)
35-
* [How to Find Dup and Missing Element](interview/Find-Duplicate-and-Missing-Element.md)
36-
* [How to Check Palindrom LinkedList](interview/check_palindromic_linkedlist.md)
18+
* I. Dynamic Programming
19+
* [Classic DP: Edit Distance](dynamic_programming/EditDistance.md)
20+
* [Classic DP: Super Egg](dynamic_programming/ThrowingEggsinHighBuildings.md)
21+
* [Classic DP: Super Egg(Advanced Solution)](dynamic_programming/SuperEggDropAdvanced.md)
22+
* [Class DP: Longest Common Subsequence](dynamic_programming/LongestCommonSubsequence.md)
23+
* [Classis DP: Game Problems](dynamic_programming/GameProblemsInDynamicProgramming.md)
24+
* [Regular Expression](dynamic_programming/RegularExpression.md)
25+
* [The Strategies of Subsequence Problem](dynamic_programming/StrategiesForSubsequenceProblem.md)
26+
* [Greedy: Interval Scheduling](dynamic_programming/IntervalScheduling.md)
27+
* [4 Keys Keyboard](dynamic_programming/FourKeysKeyboard.md)
28+
* [What is DP Optimal Substructure](dynamic_programming/OptimalSubstructure.md)
29+
* [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md)
30+
* [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md)
31+
* [House Robber Problems](dynamic_programming/HouseRobber.md)
32+
* [动态规划详解](dynamic_programming/动态规划详解进阶.md)
33+
* [团灭 LeetCode 股票买卖问题](dynamic_programming/团灭股票问题.md)
3734

3835
* II. Data Structure
3936
* [Binary Head and Priority Queue](data_structure/binary_heap_implements_priority_queues.md)
@@ -68,26 +65,29 @@ This command specifies the `english` branch and limit the depth of clone, get ri
6865
* [几个反直觉的概率问题](think_like_computer/几个反直觉的概率问题.md)
6966
* [洗牌算法](think_like_computer/洗牌算法.md)
7067

71-
* IV. Dynamic Programming
72-
* [Classic DP: Edit Distance](dynamic_programming/EditDistance.md)
73-
* [Classic DP: Super Egg](dynamic_programming/ThrowingEggsinHighBuildings.md)
74-
* [Classic DP: Super Egg(Advanced Solution)](dynamic_programming/SuperEggDropAdvanced.md)
75-
* [Class DP: Longest Common Subsequence](dynamic_programming/LongestCommonSubsequence.md)
76-
* [Classis DP: Game Problems](dynamic_programming/GameProblemsInDynamicProgramming.md)
77-
* [Regular Expression](dynamic_programming/RegularExpression.md)
78-
* [The Strategies of Subsequence Problem](dynamic_programming/StrategiesForSubsequenceProblem.md)
79-
* [Greedy: Interval Scheduling](dynamic_programming/IntervalScheduling.md)
80-
* [4 Keys Keyboard](dynamic_programming/FourKeysKeyboard.md)
81-
* [What is DP Optimal Substructure](dynamic_programming/OptimalSubstructure.md)
82-
* [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md)
83-
* [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md)
84-
* [House Robber Series](dynamic_programming/HouseRobber.md)
85-
* [动态规划详解](dynamic_programming/动态规划详解进阶.md)
86-
* [团灭 LeetCode 股票买卖问题](dynamic_programming/团灭股票问题.md)
68+
* IV. High Frequency Interview Problem
69+
* [How to Implement LRU Cache](interview/LRU_algorithm.md)
70+
* [How to Find Prime Number Efficiently](interview/Print_PrimeNumbers.md)
71+
* [How to Calculate Minimium Edit Distance](dynamic_programming/EditDistance.md)
72+
* [How to Solve Drop Water Problem](interview/Trapping_Rain_Water.md)
73+
* [How to Remove Duplicate From Sorted Sequence](interview/RemoveDuplicatesfromSortedArray.md)
74+
* [How to Find Longest Palindromic Substring](interview/TheLongestPalindromicSubstring.md)
75+
* [How to Reverse Linked List in K Group](interview/reverse-nodes-in-k-group.md)
76+
* [How to Check the Validation of Parenthesis](interview/valid-parentheses.md)
77+
* [How to Find Missing Element](interview/missing_elements.md)
78+
* [How to Pick Elements From a Arbitrary Sequence](interview/ReservoirSampling.md)
79+
* [How to use Binary Search](interview/UsingBinarySearchAlgorithm.md)
80+
* [How to Scheduling Seats](interview/Seatscheduling.md)
81+
* [Union-Find Algorithm in Detail](think_like_computer/Union-find-Explanation.md)
82+
* [Union-Find Application](think_like_computer/Union-Find-Application.md)
83+
* [Find Sebesquence With Binary Search](interview/findSebesquenceWithBinarySearch.md)
84+
* [Problems can be sloved by one line](interview/one-line-code-puzzles.md)
85+
* [How to Find Dup and Missing Element](interview/Find-Duplicate-and-Missing-Element.md)
86+
* [How to Check Palindrom LinkedList](interview/check_palindromic_linkedlist.md)
8787

8888
* V. Common Knowledge
8989
* [Difference Between Process and Thread in Linux](common_knowledge/linuxProcess.md)
9090
* [You Must Know About Linux Shell](common_knowledge/linuxshell.md)
9191
* [You Must Know About Cookie and Session](common_knowledge/SessionAndCookie.md)
9292
* [Cryptology Algorithm](common_knowledge/Cryptology.md)
93-
* [Some Good Online Pratice Platforms](common_knowledge/OnlinePraticePlatform.md)
93+
* [Some Good Online Pratice Platforms](common_knowledge/OnlinePraticePlatform.md)

‎SUMMARY.md

Lines changed: 35 additions & 35 deletions
Original file line numberDiff line numberDiff line change
@@ -2,25 +2,22 @@
22

33
* [Introduction](README.md)
44

5-
* I. High Frequency Interview Problem
6-
* [How to Implement LRU Cache](interview/LRU_algorithm.md)
7-
* [How to Find Prime Number Efficiently](interview/Print_PrimeNumbers.md)
8-
* [How to Calculate Minimium Edit Distance](dynamic_programming/EditDistance.md)
9-
* [How to Solve Drop Water Problem](interview/Trapping_Rain_Water.md)
10-
* [How to Remove Duplicate From Sorted Sequence](interview/RemoveDuplicatesfromSortedArray.md)
11-
* [How to Find Longest Palindromic Substring](interview/TheLongestPalindromicSubstring.md)
12-
* [How to Reverse Linked List in K Group](interview/reverse-nodes-in-k-group.md)
13-
* [How to Check the Validation of Parenthesis](interview/valid-parentheses.md)
14-
* [How to Find Missing Element](interview/missing_elements.md)
15-
* [How to Pick Elements From a Arbitrary Sequence](interview/ReservoirSampling.md)
16-
* [How to use Binary Search](interview/UsingBinarySearchAlgorithm.md)
17-
* [How to Scheduling Seats](interview/Seatscheduling.md)
18-
* [Union-Find Algorithm in Detail](think_like_computer/Union-find-Explanation.md)
19-
* [Union-Find Application](think_like_computer/Union-Find-Application.md)
20-
* [Find Sebesquence With Binary Search](interview/findSebesquenceWithBinarySearch.md)
21-
* [Problems can be sloved by one line](interview/one-line-code-puzzles.md)
22-
* [How to Find Dup and Missing Element](interview/Find-Duplicate-and-Missing-Element.md)
23-
* [How to Check Palindrom LinkedList](interview/check_palindromic_linkedlist.md)
5+
* I. Dynamic Programming
6+
* [Classic DP: Edit Distance](dynamic_programming/EditDistance.md)
7+
* [Classic DP: Super Egg](dynamic_programming/ThrowingEggsinHighBuildings.md)
8+
* [Classic DP: Super Egg(Advanced Solution)](dynamic_programming/SuperEggDropAdvanced.md)
9+
* [Class DP: Longest Common Subsequence](dynamic_programming/LongestCommonSubsequence.md)
10+
* [Classis DP: Game Problems](dynamic_programming/GameProblemsInDynamicProgramming.md)
11+
* [Regular Expression](dynamic_programming/RegularExpression.md)
12+
* [The Strategies of Subsequence Problem](dynamic_programming/StrategiesForSubsequenceProblem.md)
13+
* [Greedy: Interval Scheduling](dynamic_programming/IntervalScheduling.md)
14+
* [4 Keys Keyboard](dynamic_programming/FourKeysKeyboard.md)
15+
* [What is DP Optimal Substructure](dynamic_programming/OptimalSubstructure.md)
16+
* [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md)
17+
* [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md)
18+
* [House Robber Problems](dynamic_programming/HouseRobber.md)
19+
* [动态规划详解](dynamic_programming/动态规划详解进阶.md)
20+
* [团灭 LeetCode 股票买卖问题](dynamic_programming/团灭股票问题.md)
2421

2522
* II. Data Structure
2623
* [Binary Head and Priority Queue](data_structure/binary_heap_implements_priority_queues.md)
@@ -55,22 +52,25 @@
5552
* [几个反直觉的概率问题](think_like_computer/几个反直觉的概率问题.md)
5653
* [洗牌算法](think_like_computer/洗牌算法.md)
5754

58-
* IV. Dynamic Programming
59-
* [Classic DP: Edit Distance](dynamic_programming/EditDistance.md)
60-
* [Classic DP: Super Egg](dynamic_programming/ThrowingEggsinHighBuildings.md)
61-
* [Classic DP: Super Egg(Advanced Solution)](dynamic_programming/SuperEggDropAdvanced.md)
62-
* [Class DP: Longest Common Subsequence](dynamic_programming/LongestCommonSubsequence.md)
63-
* [Classis DP: Game Problems](dynamic_programming/GameProblemsInDynamicProgramming.md)
64-
* [Regular Expression](dynamic_programming/RegularExpression.md)
65-
* [The Strategies of Subsequence Problem](dynamic_programming/StrategiesForSubsequenceProblem.md)
66-
* [Greedy: Interval Scheduling](dynamic_programming/IntervalScheduling.md)
67-
* [4 Keys Keyboard](dynamic_programming/FourKeysKeyboard.md)
68-
* [What is DP Optimal Substructure](dynamic_programming/OptimalSubstructure.md)
69-
* [Longest Increasing Subsequence](dynamic_programming/LongestIncreasingSubsequence.md)
70-
* [KMP Algorithm In Detail](dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md)
71-
* [House Robber Problems](dynamic_programming/HouseRobber.md)
72-
* [动态规划详解](dynamic_programming/动态规划详解进阶.md)
73-
* [团灭 LeetCode 股票买卖问题](dynamic_programming/团灭股票问题.md)
55+
* IV. High Frequency Interview Problem
56+
* [How to Implement LRU Cache](interview/LRU_algorithm.md)
57+
* [How to Find Prime Number Efficiently](interview/Print_PrimeNumbers.md)
58+
* [How to Calculate Minimium Edit Distance](dynamic_programming/EditDistance.md)
59+
* [How to Solve Drop Water Problem](interview/Trapping_Rain_Water.md)
60+
* [How to Remove Duplicate From Sorted Sequence](interview/RemoveDuplicatesfromSortedArray.md)
61+
* [How to Find Longest Palindromic Substring](interview/TheLongestPalindromicSubstring.md)
62+
* [How to Reverse Linked List in K Group](interview/reverse-nodes-in-k-group.md)
63+
* [How to Check the Validation of Parenthesis](interview/valid-parentheses.md)
64+
* [How to Find Missing Element](interview/missing_elements.md)
65+
* [How to Pick Elements From a Arbitrary Sequence](interview/ReservoirSampling.md)
66+
* [How to use Binary Search](interview/UsingBinarySearchAlgorithm.md)
67+
* [How to Scheduling Seats](interview/Seatscheduling.md)
68+
* [Union-Find Algorithm in Detail](think_like_computer/Union-find-Explanation.md)
69+
* [Union-Find Application](think_like_computer/Union-Find-Application.md)
70+
* [Find Sebesquence With Binary Search](interview/findSebesquenceWithBinarySearch.md)
71+
* [Problems can be sloved by one line](interview/one-line-code-puzzles.md)
72+
* [How to Find Dup and Missing Element](interview/Find-Duplicate-and-Missing-Element.md)
73+
* [How to Check Palindrom LinkedList](interview/check_palindromic_linkedlist.md)
7474

7575
* V. Common Knowledge
7676
* [Difference Between Process and Thread in Linux](common_knowledge/linuxProcess.md)

0 commit comments

Comments
 (0)