| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /:user_id/:repository |
| route-controller | files |
| route-action | disambiguate |
| fetch-nonce | v2:65920eea-0a11-ff13-2550-23c948052100 |
| current-catalog-service-hash | f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb |
| request-id | 9188:3DCCC3:40E4CD:553969:6B023AF1 |
| html-safe-nonce | 0b06d57071a58e2fd746aca5e7893ca661eb38b258cc12da31e5bddeb2471271 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5MTg4OjNEQ0NDMzo0MEU0Q0Q6NTUzOTY5OjZCMDIzQUYxIiwidmlzaXRvcl9pZCI6IjI5NTc2OTU3OTgxNjAyNzYyMDkiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | be064392066643a61e991e577c6ac8ca24bfa35ccb79a3b7fcd03762fd0a9e0f |
| hovercard-subject-tag | repository:599865985 |
| github-keyboard-shortcuts | repository,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | // |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/smartb2b/LeetCode-Py |
| twitter:image | https://opengraph.githubassets.com/65b54c9c9b3ecc9ff1b1c8610df0e5b98273148fcf08f0fb94aec38903d5f0df/smartb2b/LeetCode-Py |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/65b54c9c9b3ecc9ff1b1c8610df0e5b98273148fcf08f0fb94aec38903d5f0df/smartb2b/LeetCode-Py |
| og:image:alt | ⛽️「算法通关手册」,超详细的「算法与数据结构」基础讲解教程,700+ 道「LeetCode 题目」详细解析。通过「算法理论学习」和「编程实战练习」相结合的方式,从零基础到彻底掌握算法知识。 - smartb2b/LeetCode-Py |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 87e774ee7c6b3bee0490394e4d3e57ec9dbc956f74b87ea685dc8996c1676456 |
| turbo-cache-control | no-cache |
| go-import | github.com/smartb2b/LeetCode-Py git https://github.com/smartb2b/LeetCode-Py.git |
| octolytics-dimension-user_id | 1570644 |
| octolytics-dimension-user_login | smartb2b |
| octolytics-dimension-repository_id | 599865985 |
| octolytics-dimension-repository_nwo | smartb2b/LeetCode-Py |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | true |
| octolytics-dimension-repository_parent_id | 331830597 |
| octolytics-dimension-repository_parent_nwo | itcharge/AlgoNote |
| octolytics-dimension-repository_network_root_id | 331830597 |
| octolytics-dimension-repository_network_root_nwo | itcharge/AlgoNote |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 423dbb54c5e7bfecc838eb387c1435eb3d0e760d |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| Skip to content | https://github.com/smartb2b/LeetCode-Py#start-of-content |
| https://github.com/ |
| Sign in | https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fsmartb2b%2FLeetCode-Py |
| GitHubRepository hosting, code review, and collaboration | https://github.com/platform |
| CopilotAI coding agent for tasks, projects, and automated work | https://github.com/features/copilot |
| ActionsCI/CD and automation | https://github.com/features/actions |
| Code QualityQuality analysis, fixes, and enforcement | https://github.com/features/code-quality |
| CodespacesCloud development environments | https://github.com/features/codespaces |
| Code SecurityVulnerability detection and remediation | https://github.com/security/advanced-security/code-security |
| Secret ProtectionSecret scanning and leak prevention | https://github.com/security/advanced-security/secret-protection |
| All Features | https://github.com/features |
| Documentation | https://docs.github.com/en |
| Training | https://learn.github.com/skills |
| Certifications | https://learn.github.com/credentials |
| Build with Copilot | https://github.com/features/ai |
| Customize Copilot | https://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview |
| Integrations | https://github.com/marketplace |
| Trending repos | https://github.com/trending |
| GitHub Sponsors | https://github.com/open-source/sponsors |
| Developer articles | https://github.com/resources/articles |
| ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place. | https://github.blog/changelog/ |
| Enterprises | https://github.com/enterprise |
| Team | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| Healthcare | https://github.com/solutions/industry/healthcare |
| Financial services | https://github.com/solutions/industry/financial-services |
| Manufacturing | https://github.com/solutions/industry/manufacturing |
| Government | https://github.com/solutions/industry/government |
| See all industries | https://github.com/solutions/industry |
| Why GitHub | https://github.com/why-github |
| Customer Stories | https://github.com/customer-stories |
| Business insights | https://github.com/solutions/executive-insights |
| Trust Center | https://github.com/trust-center |
| GitHub Advanced SecurityEnterprise-grade code security | https://github.com/security/advanced-security |
| Copilot for businessEnterprise-grade AI features | https://github.com/features/copilot/copilot-business |
| Premium SupportEnterprise-grade 24/7 support | https://github.com/enterprise/premium-support |
| Documentation | https://docs.github.com/en |
| Resource center | https://github.com/resources |
| Blog | https://github.blog/ |
| Events & webinars | https://github.com/resources/events |
| Community Forum | https://github.com/orgs/community/discussions |
| Customer Stories | https://github.com/customer-stories |
| Integrations | https://github.com/marketplace |
| Customer support | https://help.github.com/ |
| Training | https://learn.github.com/skills |
| GitHub Status | https://www.githubstatus.com/ |
| About | https://github.com/about |
| Partners | https://github.com/partners |
| Changelog | https://github.blog/changelog/ |
| GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub. | https://githubuniverse.com/ |
| Pricing | https://github.com/pricing |
| Sign in | https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fsmartb2b%2FLeetCode-Py |
| Sign up | https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=smartb2b%2FLeetCode-Py |
| Reload | https://github.com/smartb2b/LeetCode-Py |
| Reload | https://github.com/smartb2b/LeetCode-Py |
| Reload | https://github.com/smartb2b/LeetCode-Py |
| smartb2b | https://github.com/smartb2b |
| LeetCode-Py | https://github.com/smartb2b/LeetCode-Py |
| Code | https://github.com/smartb2b/LeetCode-Py |
| Pull requests | https://github.com/smartb2b/LeetCode-Py/pulls |
| Actions | https://github.com/smartb2b/LeetCode-Py/actions |
| Projects | https://github.com/smartb2b/LeetCode-Py/projects |
| Security and quality | https://github.com/smartb2b/LeetCode-Py/security |
| Insights | https://github.com/smartb2b/LeetCode-Py/pulse |
| https://github.com/smartb2b/LeetCode-Py |
| LeetCode-Py | https://github.com/smartb2b/LeetCode-Py |
| itcharge/AlgoNote | https://github.com/itcharge/AlgoNote |
| Notifications | https://github.com/login?return_to=%2Fsmartb2b%2FLeetCode-Py |
| Fork0 (0) | https://github.com/login?return_to=%2Fsmartb2b%2FLeetCode-Py |
| Star0 (0) | https://github.com/login?return_to=%2Fsmartb2b%2FLeetCode-Py |
| algo.itcharge.cn/ | https://algo.itcharge.cn/ |
| Readme | https://github.com/smartb2b/LeetCode-Py#readme-ov-file |
| License | https://github.com/smartb2b/LeetCode-Py#License-1-ov-file |
| Activity | https://github.com/smartb2b/LeetCode-Py/activity |
| 0 forks | https://github.com/smartb2b/LeetCode-Py/forks |
| Report repository | https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fsmartb2b%2FLeetCode-Py&report=smartb2b+%28user%29 |
| Branches | https://github.com/smartb2b/LeetCode-Py/branches |
| Tags | https://github.com/smartb2b/LeetCode-Py/tags |
| https://github.com/smartb2b/LeetCode-Py/branches |
| https://github.com/smartb2b/LeetCode-Py/tags |
| 2,843 Commits | https://github.com/smartb2b/LeetCode-Py/commits/main/ |
| https://github.com/smartb2b/LeetCode-Py/commits/main/ |
| .github/workflows | https://github.com/smartb2b/LeetCode-Py/tree/main/.github/workflows |
| .github/workflows | https://github.com/smartb2b/LeetCode-Py/tree/main/.github/workflows |
| Assets | https://github.com/smartb2b/LeetCode-Py/tree/main/Assets |
| Assets | https://github.com/smartb2b/LeetCode-Py/tree/main/Assets |
| Contents | https://github.com/smartb2b/LeetCode-Py/tree/main/Contents |
| Contents | https://github.com/smartb2b/LeetCode-Py/tree/main/Contents |
| Solutions | https://github.com/smartb2b/LeetCode-Py/tree/main/Solutions |
| Solutions | https://github.com/smartb2b/LeetCode-Py/tree/main/Solutions |
| Templates | https://github.com/smartb2b/LeetCode-Py/tree/main/Templates |
| Templates | https://github.com/smartb2b/LeetCode-Py/tree/main/Templates |
| .gitignore | https://github.com/smartb2b/LeetCode-Py/blob/main/.gitignore |
| .gitignore | https://github.com/smartb2b/LeetCode-Py/blob/main/.gitignore |
| LICENSE | https://github.com/smartb2b/LeetCode-Py/blob/main/LICENSE |
| LICENSE | https://github.com/smartb2b/LeetCode-Py/blob/main/LICENSE |
| README.md | https://github.com/smartb2b/LeetCode-Py/blob/main/README.md |
| README.md | https://github.com/smartb2b/LeetCode-Py/blob/main/README.md |
| README | https://github.com/smartb2b/LeetCode-Py |
| License | https://github.com/smartb2b/LeetCode-Py |
| https://github.com/smartb2b/LeetCode-Py#算法通关手册leetcode |
| https://github.com/smartb2b/LeetCode-Py#01-项目简介 |
| https://github.com/smartb2b/LeetCode-Py#02-项目地址 |
| https://github.com/itcharge/LeetCode-Py | https://github.com/itcharge/LeetCode-Py |
| https://algo.itcharge.cn | https://algo.itcharge.cn |
| https://github.com/smartb2b/LeetCode-Py/blob/main/Assets/Images/algo-book-light.png |
| https://github.com/smartb2b/LeetCode-Py/blob/main/Assets/Images/algo-book-dark.png |
| https://github.com/smartb2b/LeetCode-Py#03-关于作者 |
| https://github.com/smartb2b/LeetCode-Py/blob/main/Assets/Images/itcharge-qr-code.png |
| https://github.com/smartb2b/LeetCode-Py#04-版权说明 |
| 知识署名—非商业性使用—禁止演绎(BY-NC-ND)4.0 协议国际许可协议 | https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans |
| LeetCode | https://leetcode.com/ |
| 力扣中国 | https://leetcode.cn/ |
| https://github.com/smartb2b/LeetCode-Py#05-章节目录 |
| https://github.com/smartb2b/LeetCode-Py/blob/main/Assets/Images/algo-book-contents.png |
| https://github.com/smartb2b/LeetCode-Py#00-绪论 |
| 算法与数据结构 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/01.Data-Structures-Algorithms.md |
| 算法复杂度 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/02.Algorithm-Complexity.md |
| LeetCode 入门与攻略 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/03.LeetCode-Guide.md |
| LeetCode 题解(字典序排序,850+ 道题解) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/04.Solutions-List.md |
| LeetCode 题解(按分类排序,推荐刷题列表 ★★★) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/05.Categories-List.md |
| LeetCode 面试最常考 100 题(按分类排序) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/06.Interview-100-List.md |
| LeetCode 面试最常考 200 题(按分类排序) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md |
| https://github.com/smartb2b/LeetCode-Py#01-数组 |
| 数组基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/01.Array-Basic.md |
| 数组基础题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md |
| 冒泡排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md |
| 选择排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md |
| 插入排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md |
| 希尔排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md |
| 归并排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md |
| 快速排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md |
| 堆排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md |
| 计数排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md |
| 桶排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md |
| 基数排序 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md |
| 数组排序题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md |
| 二分查找知识(一) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md |
| 二分查找知识(二) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md |
| 二分查找题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md |
| 数组双指针知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md |
| 数组双指针题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md |
| 数组滑动窗口知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md |
| 数组滑动窗口题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md |
| https://github.com/smartb2b/LeetCode-Py#02-链表 |
| 链表基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md |
| 链表经典题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md |
| 链表排序知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md |
| 链表排序题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md |
| 链表双指针知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md |
| 链表双指针题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md |
| https://github.com/smartb2b/LeetCode-Py#03-堆栈 |
| 堆栈基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md |
| 堆栈基础题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md |
| 单调栈知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md |
| 单调栈题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md |
| https://github.com/smartb2b/LeetCode-Py#04-队列 |
| 队列基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md |
| 队列基础题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md |
| 优先队列知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md |
| 优先队列题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md |
| https://github.com/smartb2b/LeetCode-Py#05-哈希表 |
| 哈希表知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/05.Hash-Table/01.Hash-Table.md |
| 哈希表题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/05.Hash-Table/02.Hash-Table-List.md |
| https://github.com/smartb2b/LeetCode-Py#06-字符串 |
| 字符串基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md |
| 字符串经典题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/02.String-Basic-List.md |
| Brute Force 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md |
| Rabin Karp 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md |
| KMP 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md |
| Boyer Moore 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md |
| Horspool 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md |
| Sunday 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md |
| 单模式串匹配题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md |
| 字典树知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md |
| 字典树题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md |
| AC 自动机知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md |
| AC 自动机题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md |
| 后缀数组知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md |
| 后缀数组题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md |
| https://github.com/smartb2b/LeetCode-Py#07-树 |
| 树与二叉树基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md |
| 二叉树的遍历知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md |
| 二叉树的遍历题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md |
| 二叉树的还原知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md |
| 二叉树的还原题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md |
| 二叉搜索树知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md |
| 二叉搜索树题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md |
| 线段树知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md |
| 线段树题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md |
| 树状数组知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md |
| 树状数组题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md |
| 并查集知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/01.Union-Find.md |
| 并查集题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/02.Union-Find-List.md |
| https://github.com/smartb2b/LeetCode-Py#08-图论 |
| 图的定义和分类 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md |
| 图的存储结构和问题应用 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/02.Graph-Structure.md |
| 图的深度优先搜索知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md |
| 图的深度优先搜索题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md |
| 图的广度优先搜索知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md |
| 图的广度优先搜索题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md |
| 图的拓扑排序知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md |
| 图的拓扑排序题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md |
| 图的最小生成树知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/01.Graph-Minimum-Spanning-Tree.md |
| 图的最小生成树题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Spanning-Tree/02.Graph-Minimum-Spanning-Tree-List.md |
| 单源最短路径知识(一) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md |
| 单源最短路径知识(二) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md |
| 单源最短路径题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md |
| 多源最短路径知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md |
| 多源最短路径题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md |
| 次短路径知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md |
| 次短路径题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md |
| 差分约束系统知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md |
| 差分约束系统题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md |
| 二分图基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md |
| 二分图基础题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md |
| 二分图最大匹配知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md |
| 匈牙利算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md |
| Hopcroft-Karp 算法 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md |
| 二分图最大匹配题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md |
| https://github.com/smartb2b/LeetCode-Py#09-基础算法 |
| 枚举算法知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md |
| 枚举算法题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md |
| 递归算法知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md |
| 递归算法题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md |
| 分治算法知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md |
| 分治算法题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md |
| 回溯算法知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md |
| 回溯算法题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md |
| 贪心算法知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md |
| 贪心算法题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md |
| 位运算知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md |
| 位运算题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md |
| https://github.com/smartb2b/LeetCode-Py#10-动态规划 |
| 动态规划基础知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md |
| 动态规划基础题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md |
| 记忆化搜索知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md |
| 记忆化搜索题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md |
| 线性 DP 知识(一) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md |
| 线性 DP 知识(二) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md |
| 线性 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md |
| 背包问题知识(一) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md |
| 背包问题知识(二) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md |
| 背包问题知识(三) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md |
| 背包问题知识(四) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md |
| 背包问题知识(五) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md |
| 背包问题题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md |
| 区间 DP 知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md |
| 区间 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md |
| 树形 DP 知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md |
| 树形 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md |
| 状态压缩 DP 知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md |
| 状态压缩 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md |
| 计数 DP 知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md |
| 计数 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md |
| 数位 DP 知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md |
| 数位 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md |
| 概率 DP 知识 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md |
| 概率 DP 题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md |
| 单调栈 / 优先队列优化 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md |
| 斜率优化 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md |
| 四边形不等式优化 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md |
| 动态规划优化题目 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md |
| https://github.com/smartb2b/LeetCode-Py#11-附加内容 |
| 内容完成时间线 | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/Others/Update-Time.md |
| 12. LeetCode 题解(已完成 860 道) | https://github.com/smartb2b/LeetCode-Py/blob/main/Contents/00.Introduction/04.Solutions-List.md |
| https://github.com/smartb2b/LeetCode-Py#12-leetcode-题解已完成-860-道 |
| algo.itcharge.cn/ | https://algo.itcharge.cn/ |
| Readme | https://github.com/smartb2b/LeetCode-Py#readme-ov-file |
| License | https://github.com/smartb2b/LeetCode-Py#License-1-ov-file |
| Activity | https://github.com/smartb2b/LeetCode-Py/activity |
| 0 forks | https://github.com/smartb2b/LeetCode-Py/forks |
| Report repository | https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fsmartb2b%2FLeetCode-Py&report=smartb2b+%28user%29 |
|
| https://github.com |
| Terms | https://docs.github.com/site-policy/github-terms/github-terms-of-service |
| Privacy | https://docs.github.com/site-policy/privacy-policies/github-privacy-statement |
| Security | https://github.com/security |
| Status | https://www.githubstatus.com/ |
| Community | https://github.community/ |
| Docs | https://docs.github.com/ |
| Contact | https://support.github.com?tags=dotcom-footer |