# algorithm-stone

**Repository Path**: jefeerzhang/algorithm-stone

## Basic Information

- **Project Name**: algorithm-stone
- **Description**: ACM/LeetCode算法竞赛路线图，最全的算法学习地图！
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 29
- **Created**: 2021-04-23
- **Last Updated**: 2022-05-24

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 算法·进阶石（algorithm-stone）—— 进击的每一步！

<p align='left'>
<a href="https://github.com/acm-clan/algorithm-stone" target="_blank"><img alt="GitHub" src="https://img.shields.io/github/stars/acm-clan/algorithm-stone?label=Stars&style=flat-square&logo=GitHub"></a>    <a href="https://oss.v8cloud.cn/markdown/72eeefe8497133dd56bbe3c56c794278.png" target="_blank"><img src="https://img.shields.io/badge/公众号-@ACM算法日常-000000.svg?style=flat-square&logo=WeChat"></a>    <a href="https://www.zhihu.com/people/acm-clan" target="_blank"><img src="https://img.shields.io/badge/知乎-@ACM算法日常-000000.svg?style=flat-square&logo=Zhihu"></a>
</p>

本项目是公众号《ACM算法日常》整理的一个算法学习路线图。

### 使用说明：
1 fork本项目；  
2 使用鼠标点击下面的图片，会打开一个svg文件，按照svg文件中题目从上到下从左往右的顺序刷题，题目顺序是精心编排的，减少做题的梯度；  
3 使用vscode的leetcode插件做题；  
4 将做过的题放到user目录中，可以点亮题目，svg图片中的蓝色实验瓶子是题解链接。  

> Tip:点击svg文件中的题目，可以跳转到题目页面。

### 新手入门教程
[新手入门git - 用颜值超高的github desktop参与开源项目](docs/how_to_use_git.md)  
[新手入门vscode - 如何将宇宙最强vscode打造为刷题神器](docs/how_to_use_vscode.md)  

### 国家集训队论文1999-2019
[国家集训队论文1999-2019](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/%E5%9B%BD%E5%AE%B6%E9%9B%86%E8%AE%AD%E9%98%9F%E8%AE%BA%E6%96%871999-2019.zip)  

### 新手入门-算法书籍推荐
[01.数据结构与算法分析-C语言描述 详细书签.pdf](https://oss.v8cloud.cn/acm-clan/book/algorithm/01.%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95%E5%88%86%E6%9E%90-C%E8%AF%AD%E8%A8%80%E6%8F%8F%E8%BF%B0%20%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[02.算法设计与分析基础  第3版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/02.%E7%AE%97%E6%B3%95%E8%AE%BE%E8%AE%A1%E4%B8%8E%E5%88%86%E6%9E%90%E5%9F%BA%E7%A1%80%20%20%E7%AC%AC3%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[03.算法引论：一种创造性方法 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/03.%E7%AE%97%E6%B3%95%E5%BC%95%E8%AE%BA%EF%BC%9A%E4%B8%80%E7%A7%8D%E5%88%9B%E9%80%A0%E6%80%A7%E6%96%B9%E6%B3%95%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[04.编程原本 详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/04.%E7%BC%96%E7%A8%8B%E5%8E%9F%E6%9C%AC%20%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[05.C语言接口与实现：创建可重用软件的技术 详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/05.C%E8%AF%AD%E8%A8%80%E6%8E%A5%E5%8F%A3%E4%B8%8E%E5%AE%9E%E7%8E%B0%EF%BC%9A%E5%88%9B%E5%BB%BA%E5%8F%AF%E9%87%8D%E7%94%A8%E8%BD%AF%E4%BB%B6%E7%9A%84%E6%8A%80%E6%9C%AF%20%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[06.算法导论中文第三版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/06.%E7%AE%97%E6%B3%95%E5%AF%BC%E8%AE%BA%E4%B8%AD%E6%96%87%E7%AC%AC%E4%B8%89%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[06.算法导论英文第三版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/06.%E7%AE%97%E6%B3%95%E5%AF%BC%E8%AE%BA%E8%8B%B1%E6%96%87%E7%AC%AC%E4%B8%89%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[07.算法中文第4版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/07.%E7%AE%97%E6%B3%95%E4%B8%AD%E6%96%87%E7%AC%AC4%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[07.算法英文第4版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/07.%E7%AE%97%E6%B3%95%E8%8B%B1%E6%96%87%E7%AC%AC4%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[08.算法竞赛入门经典第2版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/08.%E7%AE%97%E6%B3%95%E7%AB%9E%E8%B5%9B%E5%85%A5%E9%97%A8%E7%BB%8F%E5%85%B8%E7%AC%AC2%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[09.挑战程序设计竞赛1第2版 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/09.%E6%8C%91%E6%88%98%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%AB%9E%E8%B5%9B1%E7%AC%AC2%E7%89%88%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[10.挑战程序设计竞赛2 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/10.%E6%8C%91%E6%88%98%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%AB%9E%E8%B5%9B2%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>
[11.算法竞赛进阶指南 有水印.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/11.%E7%AE%97%E6%B3%95%E7%AB%9E%E8%B5%9B%E8%BF%9B%E9%98%B6%E6%8C%87%E5%8D%97%20%E6%9C%89%E6%B0%B4%E5%8D%B0.pdf)<br>
[12.漫画算法-小灰的算法之旅 高清详细书签.pdf](https://v8cloud.oss-cn-hangzhou.aliyuncs.com/acm-clan/book/algorithm/12.%E6%BC%AB%E7%94%BB%E7%AE%97%E6%B3%95-%E5%B0%8F%E7%81%B0%E7%9A%84%E7%AE%97%E6%B3%95%E4%B9%8B%E6%97%85%20%E9%AB%98%E6%B8%85%E8%AF%A6%E7%BB%86%E4%B9%A6%E7%AD%BE.pdf)<br>

### Leetcode路线图合集

#### Tree路线图（进度100%）
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/leetcode_tree.svg">

#### 动态规划路线图（进度40%）
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/leetcode_dp.svg">

<!-- #### 并查集路线图（进度10%）
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/leetcode_union_find.svg"> -->

#### 堆栈队列路线图（进度100%）
1. [算法动画秒懂并查集](https://mp.weixin.qq.com/s/rF5bohHf3XfstGkjBawBuw)
2. [动画解说单调栈](https://mp.weixin.qq.com/s/XsYD1lkiILcMcd3_vRws7A)  
3. [滑动窗口入门](https://mp.weixin.qq.com/s/InpmYAfeesc7MHMCV50b-Q)  
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/leetcode_heap_stack_queue.svg">

#### 链表路线图（进度100%）
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/leetcode_linked_list.svg">


#### 小众题路线图（进度100%）
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/leetcode_mini.svg">

### Codeforces Div.3 Div.2路线图（进度1%）
<img src="https://raw.githubusercontent.com/acm-clan/algorithm-stone/main/images/codeforces.svg">

### 安装开发环境

详细的开发说明参考：[开发文档](https://github.com/acm-clan/algorithm-stone/blob/main/docs/dev_zh.md)

### Leetcode规划模块
以下是Leetcode所有模块，按照题目数量进行排序。  

| 中文名称 | 英文名称 | 题目数量 | 整理人 | 进度 |
| ---- | ---- | ---- | ---- | ---- |
|[拒绝采样](https://leetcode-cn.com/tag/rejection-sampling)| `rejection-sampling`| 2 | `dansen` | 100% |  
|[蓄水池采样](https://leetcode-cn.com/tag/reservoir-sampling)| `reservoir-sampling` | 2 |`dansen` | 100% |  
|[记忆](https://leetcode-cn.com/tag/memoization)| memoization | 3 | `dansen`| 100% |  
|[扫描线](https://leetcode-cn.com/tag/line-sweep)| line-sweep | 4 |`dansen` | 100% |  
|[拓扑排序](https://leetcode-cn.com/tag/topological-sort)| `topological-sort` | 4 |`dansen` | 100% |  
|[二分查找树](https://leetcode-cn.com/tag/binary-search-tree)| `binary-search-tree` | 5 |`dansen` | 100% |  
|[树状数组](https://leetcode-cn.com/tag/binary-indexed-tree)| `binary-indexed-tree` | 6 |`dansen` | 100% |  
|[随机数](https://leetcode-cn.com/tag/random)| `random`  | 6 |`dansen` | 100% |
|[智商题](https://leetcode-cn.com/tag/brainteaser)| `brainteaser`  | 7 |`dansen` | 100% |
|[最小最大值](https://leetcode-cn.com/tag/minimax)| `minimax`  | 7 |`dansen` | 100% |
|[队列](https://leetcode-cn.com/tag/queue)| queue  | 10 |`dansen` | 100% |
|[几何题](https://leetcode-cn.com/tag/geometry)| geometry  | 12 | | 0% |
|[排序Map](https://leetcode-cn.com/tag/ordered-map)| ordered-map  | 13 | | 0% |
|[线段树](https://leetcode-cn.com/tag/segment-tree)| segment-tree  | 15 | | 0% |
|[Trie树](https://leetcode-cn.com/tag/trie)| trie  | 17 | | 0% |
|[滑动窗口](https://leetcode-cn.com/tag/sliding-window)| sliding-window  | 25 |`dansen` | 100% |
|[分治算法](https://leetcode-cn.com/tag/divide-and-conquer)| divide-and-conquer  | 28 | | 0% |
|[并查集](https://leetcode-cn.com/tag/union-find)| union-find  |  29  | | 100% |
|[递归](https://leetcode-cn.com/tag/recursion)| recursion  | 40 | | 0% |
|[图论](https://leetcode-cn.com/tag/graph)| graph  | 43 | | 0% |
|[堆](https://leetcode-cn.com/tag/heap)| heap  |43  |`dansen` | 100% |
|[设计题](https://leetcode-cn.com/tag/design)| design  | 47 | | 0% |
|[链表](https://leetcode-cn.com/tag/linked-list)| `linked-list` | 51 |`chocolate` | 100% |
|[回溯算法](https://leetcode-cn.com/tag/backtracking)| backtracking  | 61 | | 0% |
|[位运算](https://leetcode-cn.com/tag/bit-manipulation)| bit-manipulation  | 66 | | 0% |
|[栈](https://leetcode-cn.com/tag/stack)| stack  | 66 |`dansen` | 100% |
|[排序](https://leetcode-cn.com/tag/sort)| sort  |68  | | 0% |
|[双指针](https://leetcode-cn.com/tag/two-pointers)| two-pointers  | 73 | | 0% |
|[BFS搜索](https://leetcode-cn.com/tag/breadth-first-search)| breadth-first-search  | 76 | | 0% |
|[二分查找](https://leetcode-cn.com/tag/binary-search)| binary-search  | 97 | | 0% |
|[Hash表](https://leetcode-cn.com/tag/hash-table)| hash-table  | 121 | | 0% |
|[贪心算法](https://leetcode-cn.com/tag/greedy)| greedy  | 128 | | 0% |
|[DFS搜索](https://leetcode-cn.com/tag/depth-first-search)| depth-first-search  | 137 | | 0% |
|[树](https://leetcode-cn.com/tag/tree)| `tree`  | 142 |`dansen` | 100% |
|[数学题](https://leetcode-cn.com/tag/math)| math  | 191 | | 0% |
|[字符串](https://leetcode-cn.com/tag/string)| string  | 209 | | 0% |
|[动态规划](https://leetcode-cn.com/tag/dynamic-programming)| `dynamic-programming` | 240 | `dansen` | | 60% |
|[数组](https://leetcode-cn.com/tag/array)| array|310  | | 0% |