algorithm/fucking-algorithm
1
0
Fork 0
mirror of https://github.com/labuladong/fucking-algorithm.git synced 2025-07-04 19:28:07 +08:00
Code Issues Packages Projects Releases Wiki Activity

update content

Browse Source
This commit is contained in:
labuladong
2023-08-16 00:43:03 +08:00
parent 67ffc1a1b9
commit b9f49d6ffb
6 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -129,12 +129,12 @@ PDF 共两本，一本《labuladong 的算法秘籍》类似教材，帮你系
### [本站简介](https://labuladong.github.io/article/fname.html?fname=home) ### [本站简介](https://labuladong.github.io/article/fname.html?fname=home)
### [准备工作：安装刷题全家桶](https://labuladong.github.io/article/fname.html?fname=全家桶简介) ### [准备工作：安装刷题全家桶](https://labuladong.github.io/article/fname.html?fname=全家桶简介)
* [配套浏览器刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) * [算法可视化功能简介（必读）](https://labuladong.github.io/article/fname.html?fname=可视化简介)
* [配套 Chrome 刷题插件（必装）](https://labuladong.github.io/article/fname.html?fname=chrome插件简介)
* [配套 vscode 刷题插件](https://labuladong.github.io/article/fname.html?fname=vscode插件简介) * [配套 vscode 刷题插件](https://labuladong.github.io/article/fname.html?fname=vscode插件简介)
* [配套 JetBrains 刷题插件](https://labuladong.github.io/article/fname.html?fname=jb插件简介) * [配套 JetBrains 刷题插件](https://labuladong.github.io/article/fname.html?fname=jb插件简介)
* [算法可视化功能简介](https://labuladong.github.io/article/fname.html?fname=可视化简介)
* [数据结构精品课](https://labuladong.github.io/article/fname.html?fname=ds课程简介) * [数据结构精品课](https://labuladong.github.io/article/fname.html?fname=ds课程简介)
* [二叉树（递归）专题课](https://labuladong.github.io/article/fname.html?fname=tree课程简介) * [二叉树递归专题课](https://labuladong.github.io/article/fname.html?fname=tree课程简介)
* [14 天刷题打卡挑战](https://labuladong.github.io/article/fname.html?fname=打卡挑战简介) * [14 天刷题打卡挑战](https://labuladong.github.io/article/fname.html?fname=打卡挑战简介)
* [学习本站所需的 Java 基础](https://labuladong.github.io/article/fname.html?fname=网站Java基础) * [学习本站所需的 Java 基础](https://labuladong.github.io/article/fname.html?fname=网站Java基础)

2
动态规划系列/动态规划详解进阶.md
View File

@ -474,7 +474,7 @@ int coinChange(int[] coins, int amount) {
- [旅游省钱大法：加权最短路径](https://labuladong.github.io/article/fname.html?fname=旅行最短路径) - [旅游省钱大法：加权最短路径](https://labuladong.github.io/article/fname.html?fname=旅行最短路径)
- [最优子结构原理和 dp 数组遍历方向](https://labuladong.github.io/article/fname.html?fname=最优子结构) - [最优子结构原理和 dp 数组遍历方向](https://labuladong.github.io/article/fname.html?fname=最优子结构)
- [本站简介](https://labuladong.github.io/article/fname.html?fname=home) - [本站简介](https://labuladong.github.io/article/fname.html?fname=home)
- [算法可视化功能简介](https://labuladong.github.io/article/fname.html?fname=可视化简介) - [算法可视化功能简介（必读）](https://labuladong.github.io/article/fname.html?fname=可视化简介)
- [算法学习和心流体验](https://labuladong.github.io/article/fname.html?fname=心流) - [算法学习和心流体验](https://labuladong.github.io/article/fname.html?fname=心流)
- [算法时空复杂度分析实用指南](https://labuladong.github.io/article/fname.html?fname=时间复杂度) - [算法时空复杂度分析实用指南](https://labuladong.github.io/article/fname.html?fname=时间复杂度)
- [算法笔试「骗分」套路](https://labuladong.github.io/article/fname.html?fname=刷题技巧) - [算法笔试「骗分」套路](https://labuladong.github.io/article/fname.html?fname=刷题技巧)

4
数据结构系列/二叉树总结.md
View File

@ -920,7 +920,7 @@ class Solution {
- [东哥带你刷二叉树（序列化篇）](https://labuladong.github.io/article/fname.html?fname=二叉树的序列化) - [东哥带你刷二叉树（序列化篇）](https://labuladong.github.io/article/fname.html?fname=二叉树的序列化)
- [东哥带你刷二叉树（思路篇）](https://labuladong.github.io/article/fname.html?fname=二叉树系列1) - [东哥带你刷二叉树（思路篇）](https://labuladong.github.io/article/fname.html?fname=二叉树系列1)
- [东哥带你刷二叉树（构造篇）](https://labuladong.github.io/article/fname.html?fname=二叉树系列2) - [东哥带你刷二叉树（构造篇）](https://labuladong.github.io/article/fname.html?fname=二叉树系列2)
- [二叉树（递归）专题课](https://labuladong.github.io/article/fname.html?fname=tree课程简介) - [二叉树递归专题课](https://labuladong.github.io/article/fname.html?fname=tree课程简介)
- [前缀树算法模板秒杀五道算法题](https://labuladong.github.io/article/fname.html?fname=trie) - [前缀树算法模板秒杀五道算法题](https://labuladong.github.io/article/fname.html?fname=trie)
- [动态规划和回溯算法的思维转换](https://labuladong.github.io/article/fname.html?fname=单词拼接) - [动态规划和回溯算法的思维转换](https://labuladong.github.io/article/fname.html?fname=单词拼接)
- [后序遍历的妙用](https://labuladong.github.io/article/fname.html?fname=后序遍历) - [后序遍历的妙用](https://labuladong.github.io/article/fname.html?fname=后序遍历)
@ -931,7 +931,7 @@ class Solution {
- [归并排序详解及应用](https://labuladong.github.io/article/fname.html?fname=归并排序) - [归并排序详解及应用](https://labuladong.github.io/article/fname.html?fname=归并排序)
- [我的刷题心得](https://labuladong.github.io/article/fname.html?fname=算法心得) - [我的刷题心得](https://labuladong.github.io/article/fname.html?fname=算法心得)
- [本站简介](https://labuladong.github.io/article/fname.html?fname=home) - [本站简介](https://labuladong.github.io/article/fname.html?fname=home)
- [算法可视化功能简介](https://labuladong.github.io/article/fname.html?fname=可视化简介) - [算法可视化功能简介（必读）](https://labuladong.github.io/article/fname.html?fname=可视化简介)
- [算法学习和心流体验](https://labuladong.github.io/article/fname.html?fname=心流) - [算法学习和心流体验](https://labuladong.github.io/article/fname.html?fname=心流)
</details><hr> </details><hr>

2
算法思维系列/学习数据结构和算法的高效方法.md
View File

@ -360,7 +360,7 @@ N 叉树的遍历框架，找出来了吧？你说，树这种结构重不重要
- [东哥带你刷二叉树（纲领篇）](https://labuladong.github.io/article/fname.html?fname=二叉树总结) - [东哥带你刷二叉树（纲领篇）](https://labuladong.github.io/article/fname.html?fname=二叉树总结)
- [二分图判定算法](https://labuladong.github.io/article/fname.html?fname=二分图) - [二分图判定算法](https://labuladong.github.io/article/fname.html?fname=二分图)
- [二叉树的递归转迭代的代码框架](https://labuladong.github.io/article/fname.html?fname=迭代遍历二叉树) - [二叉树的递归转迭代的代码框架](https://labuladong.github.io/article/fname.html?fname=迭代遍历二叉树)
- [二叉树（递归）专题课](https://labuladong.github.io/article/fname.html?fname=tree课程简介) - [二叉树递归专题课](https://labuladong.github.io/article/fname.html?fname=tree课程简介)
- [前缀树算法模板秒杀五道算法题](https://labuladong.github.io/article/fname.html?fname=trie) - [前缀树算法模板秒杀五道算法题](https://labuladong.github.io/article/fname.html?fname=trie)
- [回溯算法秒杀所有排列/组合/子集问题](https://labuladong.github.io/article/fname.html?fname=子集排列组合) - [回溯算法秒杀所有排列/组合/子集问题](https://labuladong.github.io/article/fname.html?fname=子集排列组合)
- [回溯算法解题套路框架](https://labuladong.github.io/article/fname.html?fname=回溯算法详解修订版) - [回溯算法解题套路框架](https://labuladong.github.io/article/fname.html?fname=回溯算法详解修订版)

3
高频面试系列/子集排列组合.md
View File

@ -989,7 +989,7 @@ void backtrack(int[] nums) {
- [动态规划和回溯算法的思维转换](https://labuladong.github.io/article/fname.html?fname=单词拼接) - [动态规划和回溯算法的思维转换](https://labuladong.github.io/article/fname.html?fname=单词拼接)
- [回溯算法解题套路框架](https://labuladong.github.io/article/fname.html?fname=回溯算法详解修订版) - [回溯算法解题套路框架](https://labuladong.github.io/article/fname.html?fname=回溯算法详解修订版)
- [我的刷题心得](https://labuladong.github.io/article/fname.html?fname=算法心得) - [我的刷题心得](https://labuladong.github.io/article/fname.html?fname=算法心得)
- [算法可视化功能简介](https://labuladong.github.io/article/fname.html?fname=可视化简介) - [算法可视化功能简介（必读）](https://labuladong.github.io/article/fname.html?fname=可视化简介)
- [算法时空复杂度分析实用指南](https://labuladong.github.io/article/fname.html?fname=时间复杂度) - [算法时空复杂度分析实用指南](https://labuladong.github.io/article/fname.html?fname=时间复杂度)
- [经典回溯算法：集合划分问题](https://labuladong.github.io/article/fname.html?fname=集合划分) - [经典回溯算法：集合划分问题](https://labuladong.github.io/article/fname.html?fname=集合划分)
@ -1011,6 +1011,7 @@ void backtrack(int[] nums) {
| [254. Factor Combinations](https://leetcode.com/problems/factor-combinations/?show=1)🔒 | [254. 因子的组合](https://leetcode.cn/problems/factor-combinations/?show=1)🔒 | | [254. Factor Combinations](https://leetcode.com/problems/factor-combinations/?show=1)🔒 | [254. 因子的组合](https://leetcode.cn/problems/factor-combinations/?show=1)🔒 |
| [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/?show=1) | [368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/?show=1) | | [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/?show=1) | [368. 最大整除子集](https://leetcode.cn/problems/largest-divisible-subset/?show=1) |
| [491. Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/?show=1) | [491. 递增子序列](https://leetcode.cn/problems/non-decreasing-subsequences/?show=1) | | [491. Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/?show=1) | [491. 递增子序列](https://leetcode.cn/problems/non-decreasing-subsequences/?show=1) |
| [638. Shopping Offers](https://leetcode.com/problems/shopping-offers/?show=1) | [638. 大礼包](https://leetcode.cn/problems/shopping-offers/?show=1) |
| - | [剑指 Offer 38. 字符串的排列](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/?show=1) | | - | [剑指 Offer 38. 字符串的排列](https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof/?show=1) |
| - | [剑指 Offer II 079. 所有子集](https://leetcode.cn/problems/TVdhkn/?show=1) | | - | [剑指 Offer II 079. 所有子集](https://leetcode.cn/problems/TVdhkn/?show=1) |
| - | [剑指 Offer II 080. 含有 k 个元素的组合](https://leetcode.cn/problems/uUsW3B/?show=1) | | - | [剑指 Offer II 080. 含有 k 个元素的组合](https://leetcode.cn/problems/uUsW3B/?show=1) |

2
高频面试系列/打印素数.md
View File

@ -189,7 +189,7 @@ class Solution {
<summary><strong>引用本文的文章</strong></summary> <summary><strong>引用本文的文章</strong></summary>
- [丑数系列算法详解](https://labuladong.github.io/article/fname.html?fname=丑数) - [丑数系列算法详解](https://labuladong.github.io/article/fname.html?fname=丑数)
- [配套浏览器刷题插件](https://labuladong.github.io/article/fname.html?fname=chrome插件简介) - [配套 Chrome 刷题插件（必装）](https://labuladong.github.io/article/fname.html?fname=chrome插件简介)
</details><hr> </details><hr>