Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
rrrrutdk
Fucking Algorithm
提交
a5d00752
F
Fucking Algorithm
项目概览
rrrrutdk
/
Fucking Algorithm
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
F
Fucking Algorithm
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
前往新版Gitcode，体验更适合开发者的 AI 搜索 >>
提交
a5d00752
编写于
3月 11, 2020
作者:
L
labuladong
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
adjust number of chapter
上级
f1b23651
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
71 addition
and
71 deletion
+71
-71
README.md
README.md
+36
-36
SUMMARY.md
SUMMARY.md
+35
-35
未找到文件。
README.md
浏览文件 @
a5d00752
...
...
@@ -15,25 +15,22 @@ This command specifies the `english` branch and limit the depth of clone, get ri
# Table of Content
*
I. High Frequency Interview Problem
*
[
How to Implement LRU Cache
](
interview/LRU_algorithm.md
)
*
[
How to Find Prime Number Efficiently
](
interview/Print_PrimeNumbers.md
)
*
[
How to Calculate Minimium Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
How to Solve Drop Water Problem
](
interview/Trapping_Rain_Water.md
)
*
[
How to Remove Duplicate From Sorted Sequence
](
interview/RemoveDuplicatesfromSortedArray.md
)
*
[
How to Find Longest Palindromic Substring
](
interview/TheLongestPalindromicSubstring.md
)
*
[
How to Reverse Linked List in K Group
](
interview/reverse-nodes-in-k-group.md
)
*
[
How to Check the Validation of Parenthesis
](
interview/valid-parentheses.md
)
*
[
How to Find Missing Element
](
interview/missing_elements.md
)
*
[
How to Pick Elements From a Arbitrary Sequence
](
interview/ReservoirSampling.md
)
*
[
How to use Binary Search
](
interview/UsingBinarySearchAlgorithm.md
)
*
[
How to Scheduling Seats
](
interview/Seatscheduling.md
)
*
[
Union-Find Algorithm in Detail
](
think_like_computer/Union-find-Explanation.md
)
*
[
Union-Find Application
](
think_like_computer/Union-Find-Application.md
)
*
[
Find Sebesquence With Binary Search
](
interview/findSebesquenceWithBinarySearch.md
)
*
[
Problems can be sloved by one line
](
interview/one-line-code-puzzles.md
)
*
[
How to Find Dup and Missing Element
](
interview/Find-Duplicate-and-Missing-Element.md
)
*
[
How to Check Palindrom LinkedList
](
interview/check_palindromic_linkedlist.md
)
*
I. Dynamic Programming
*
[
Classic DP: Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
Classic DP: Super Egg
](
dynamic_programming/ThrowingEggsinHighBuildings.md
)
*
[
Classic DP: Super Egg(Advanced Solution)
](
dynamic_programming/SuperEggDropAdvanced.md
)
*
[
Class DP: Longest Common Subsequence
](
dynamic_programming/LongestCommonSubsequence.md
)
*
[
Classis DP: Game Problems
](
dynamic_programming/GameProblemsInDynamicProgramming.md
)
*
[
Regular Expression
](
dynamic_programming/RegularExpression.md
)
*
[
The Strategies of Subsequence Problem
](
dynamic_programming/StrategiesForSubsequenceProblem.md
)
*
[
Greedy: Interval Scheduling
](
dynamic_programming/IntervalScheduling.md
)
*
[
4 Keys Keyboard
](
dynamic_programming/FourKeysKeyboard.md
)
*
[
What is DP Optimal Substructure
](
dynamic_programming/OptimalSubstructure.md
)
*
[
Longest Increasing Subsequence
](
dynamic_programming/LongestIncreasingSubsequence.md
)
*
[
KMP Algorithm In Detail
](
dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md
)
*
[
House Robber Problems
](
dynamic_programming/HouseRobber.md
)
*
[
动态规划详解
](
dynamic_programming/动态规划详解进阶.md
)
*
[
团灭 LeetCode 股票买卖问题
](
dynamic_programming/团灭股票问题.md
)
*
II. Data Structure
*
[
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
*
[
几个反直觉的概率问题
](
think_like_computer/几个反直觉的概率问题.md
)
*
[
洗牌算法
](
think_like_computer/洗牌算法.md
)
*
IV. Dynamic Programming
*
[
Classic DP: Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
Classic DP: Super Egg
](
dynamic_programming/ThrowingEggsinHighBuildings.md
)
*
[
Classic DP: Super Egg(Advanced Solution)
](
dynamic_programming/SuperEggDropAdvanced.md
)
*
[
Class DP: Longest Common Subsequence
](
dynamic_programming/LongestCommonSubsequence.md
)
*
[
Classis DP: Game Problems
](
dynamic_programming/GameProblemsInDynamicProgramming.md
)
*
[
Regular Expression
](
dynamic_programming/RegularExpression.md
)
*
[
The Strategies of Subsequence Problem
](
dynamic_programming/StrategiesForSubsequenceProblem.md
)
*
[
Greedy: Interval Scheduling
](
dynamic_programming/IntervalScheduling.md
)
*
[
4 Keys Keyboard
](
dynamic_programming/FourKeysKeyboard.md
)
*
[
What is DP Optimal Substructure
](
dynamic_programming/OptimalSubstructure.md
)
*
[
Longest Increasing Subsequence
](
dynamic_programming/LongestIncreasingSubsequence.md
)
*
[
KMP Algorithm In Detail
](
dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md
)
*
[
House Robber Series
](
dynamic_programming/HouseRobber.md
)
*
[
动态规划详解
](
dynamic_programming/动态规划详解进阶.md
)
*
[
团灭 LeetCode 股票买卖问题
](
dynamic_programming/团灭股票问题.md
)
*
IV. High Frequency Interview Problem
*
[
How to Implement LRU Cache
](
interview/LRU_algorithm.md
)
*
[
How to Find Prime Number Efficiently
](
interview/Print_PrimeNumbers.md
)
*
[
How to Calculate Minimium Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
How to Solve Drop Water Problem
](
interview/Trapping_Rain_Water.md
)
*
[
How to Remove Duplicate From Sorted Sequence
](
interview/RemoveDuplicatesfromSortedArray.md
)
*
[
How to Find Longest Palindromic Substring
](
interview/TheLongestPalindromicSubstring.md
)
*
[
How to Reverse Linked List in K Group
](
interview/reverse-nodes-in-k-group.md
)
*
[
How to Check the Validation of Parenthesis
](
interview/valid-parentheses.md
)
*
[
How to Find Missing Element
](
interview/missing_elements.md
)
*
[
How to Pick Elements From a Arbitrary Sequence
](
interview/ReservoirSampling.md
)
*
[
How to use Binary Search
](
interview/UsingBinarySearchAlgorithm.md
)
*
[
How to Scheduling Seats
](
interview/Seatscheduling.md
)
*
[
Union-Find Algorithm in Detail
](
think_like_computer/Union-find-Explanation.md
)
*
[
Union-Find Application
](
think_like_computer/Union-Find-Application.md
)
*
[
Find Sebesquence With Binary Search
](
interview/findSebesquenceWithBinarySearch.md
)
*
[
Problems can be sloved by one line
](
interview/one-line-code-puzzles.md
)
*
[
How to Find Dup and Missing Element
](
interview/Find-Duplicate-and-Missing-Element.md
)
*
[
How to Check Palindrom LinkedList
](
interview/check_palindromic_linkedlist.md
)
*
V. Common Knowledge
*
[
Difference Between Process and Thread in Linux
](
common_knowledge/linuxProcess.md
)
*
[
You Must Know About Linux Shell
](
common_knowledge/linuxshell.md
)
*
[
You Must Know About Cookie and Session
](
common_knowledge/SessionAndCookie.md
)
*
[
Cryptology Algorithm
](
common_knowledge/Cryptology.md
)
*
[
Some Good Online Pratice Platforms
](
common_knowledge/OnlinePraticePlatform.md
)
*
[
Some Good Online Pratice Platforms
](
common_knowledge/OnlinePraticePlatform.md
)
\ No newline at end of file
SUMMARY.md
浏览文件 @
a5d00752
...
...
@@ -2,25 +2,22 @@
*
[
Introduction
](
README.md
)
*
I. High Frequency Interview Problem
*
[
How to Implement LRU Cache
](
interview/LRU_algorithm.md
)
*
[
How to Find Prime Number Efficiently
](
interview/Print_PrimeNumbers.md
)
*
[
How to Calculate Minimium Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
How to Solve Drop Water Problem
](
interview/Trapping_Rain_Water.md
)
*
[
How to Remove Duplicate From Sorted Sequence
](
interview/RemoveDuplicatesfromSortedArray.md
)
*
[
How to Find Longest Palindromic Substring
](
interview/TheLongestPalindromicSubstring.md
)
*
[
How to Reverse Linked List in K Group
](
interview/reverse-nodes-in-k-group.md
)
*
[
How to Check the Validation of Parenthesis
](
interview/valid-parentheses.md
)
*
[
How to Find Missing Element
](
interview/missing_elements.md
)
*
[
How to Pick Elements From a Arbitrary Sequence
](
interview/ReservoirSampling.md
)
*
[
How to use Binary Search
](
interview/UsingBinarySearchAlgorithm.md
)
*
[
How to Scheduling Seats
](
interview/Seatscheduling.md
)
*
[
Union-Find Algorithm in Detail
](
think_like_computer/Union-find-Explanation.md
)
*
[
Union-Find Application
](
think_like_computer/Union-Find-Application.md
)
*
[
Find Sebesquence With Binary Search
](
interview/findSebesquenceWithBinarySearch.md
)
*
[
Problems can be sloved by one line
](
interview/one-line-code-puzzles.md
)
*
[
How to Find Dup and Missing Element
](
interview/Find-Duplicate-and-Missing-Element.md
)
*
[
How to Check Palindrom LinkedList
](
interview/check_palindromic_linkedlist.md
)
*
I. Dynamic Programming
*
[
Classic DP: Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
Classic DP: Super Egg
](
dynamic_programming/ThrowingEggsinHighBuildings.md
)
*
[
Classic DP: Super Egg(Advanced Solution)
](
dynamic_programming/SuperEggDropAdvanced.md
)
*
[
Class DP: Longest Common Subsequence
](
dynamic_programming/LongestCommonSubsequence.md
)
*
[
Classis DP: Game Problems
](
dynamic_programming/GameProblemsInDynamicProgramming.md
)
*
[
Regular Expression
](
dynamic_programming/RegularExpression.md
)
*
[
The Strategies of Subsequence Problem
](
dynamic_programming/StrategiesForSubsequenceProblem.md
)
*
[
Greedy: Interval Scheduling
](
dynamic_programming/IntervalScheduling.md
)
*
[
4 Keys Keyboard
](
dynamic_programming/FourKeysKeyboard.md
)
*
[
What is DP Optimal Substructure
](
dynamic_programming/OptimalSubstructure.md
)
*
[
Longest Increasing Subsequence
](
dynamic_programming/LongestIncreasingSubsequence.md
)
*
[
KMP Algorithm In Detail
](
dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md
)
*
[
House Robber Problems
](
dynamic_programming/HouseRobber.md
)
*
[
动态规划详解
](
dynamic_programming/动态规划详解进阶.md
)
*
[
团灭 LeetCode 股票买卖问题
](
dynamic_programming/团灭股票问题.md
)
*
II. Data Structure
*
[
Binary Head and Priority Queue
](
data_structure/binary_heap_implements_priority_queues.md
)
...
...
@@ -55,22 +52,25 @@
*
[
几个反直觉的概率问题
](
think_like_computer/几个反直觉的概率问题.md
)
*
[
洗牌算法
](
think_like_computer/洗牌算法.md
)
*
IV. Dynamic Programming
*
[
Classic DP: Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
Classic DP: Super Egg
](
dynamic_programming/ThrowingEggsinHighBuildings.md
)
*
[
Classic DP: Super Egg(Advanced Solution)
](
dynamic_programming/SuperEggDropAdvanced.md
)
*
[
Class DP: Longest Common Subsequence
](
dynamic_programming/LongestCommonSubsequence.md
)
*
[
Classis DP: Game Problems
](
dynamic_programming/GameProblemsInDynamicProgramming.md
)
*
[
Regular Expression
](
dynamic_programming/RegularExpression.md
)
*
[
The Strategies of Subsequence Problem
](
dynamic_programming/StrategiesForSubsequenceProblem.md
)
*
[
Greedy: Interval Scheduling
](
dynamic_programming/IntervalScheduling.md
)
*
[
4 Keys Keyboard
](
dynamic_programming/FourKeysKeyboard.md
)
*
[
What is DP Optimal Substructure
](
dynamic_programming/OptimalSubstructure.md
)
*
[
Longest Increasing Subsequence
](
dynamic_programming/LongestIncreasingSubsequence.md
)
*
[
KMP Algorithm In Detail
](
dynamic_programming/KMPCharacterMatchingAlgorithmInDynamicProgramming.md
)
*
[
House Robber Problems
](
dynamic_programming/HouseRobber.md
)
*
[
动态规划详解
](
dynamic_programming/动态规划详解进阶.md
)
*
[
团灭 LeetCode 股票买卖问题
](
dynamic_programming/团灭股票问题.md
)
*
IV. High Frequency Interview Problem
*
[
How to Implement LRU Cache
](
interview/LRU_algorithm.md
)
*
[
How to Find Prime Number Efficiently
](
interview/Print_PrimeNumbers.md
)
*
[
How to Calculate Minimium Edit Distance
](
dynamic_programming/EditDistance.md
)
*
[
How to Solve Drop Water Problem
](
interview/Trapping_Rain_Water.md
)
*
[
How to Remove Duplicate From Sorted Sequence
](
interview/RemoveDuplicatesfromSortedArray.md
)
*
[
How to Find Longest Palindromic Substring
](
interview/TheLongestPalindromicSubstring.md
)
*
[
How to Reverse Linked List in K Group
](
interview/reverse-nodes-in-k-group.md
)
*
[
How to Check the Validation of Parenthesis
](
interview/valid-parentheses.md
)
*
[
How to Find Missing Element
](
interview/missing_elements.md
)
*
[
How to Pick Elements From a Arbitrary Sequence
](
interview/ReservoirSampling.md
)
*
[
How to use Binary Search
](
interview/UsingBinarySearchAlgorithm.md
)
*
[
How to Scheduling Seats
](
interview/Seatscheduling.md
)
*
[
Union-Find Algorithm in Detail
](
think_like_computer/Union-find-Explanation.md
)
*
[
Union-Find Application
](
think_like_computer/Union-Find-Application.md
)
*
[
Find Sebesquence With Binary Search
](
interview/findSebesquenceWithBinarySearch.md
)
*
[
Problems can be sloved by one line
](
interview/one-line-code-puzzles.md
)
*
[
How to Find Dup and Missing Element
](
interview/Find-Duplicate-and-Missing-Element.md
)
*
[
How to Check Palindrom LinkedList
](
interview/check_palindromic_linkedlist.md
)
*
V. Common Knowledge
*
[
Difference Between Process and Thread in Linux
](
common_knowledge/linuxProcess.md
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑！
取消
想要评论请
注册
或
登录
