René's URL Explorer Experiment

Title: GitHub - hopeforcode/leetcode-master: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀 · GitHub

Open Graph Title: GitHub - hopeforcode/leetcode-master: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀

X Title: GitHub - hopeforcode/leetcode-master: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀

Description: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀 - GitHub - hopeforcode/leetcode-master: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀

Open Graph Description: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀 - hopeforcode/leetcode-master

X Description: 《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀 - hopeforcode/leetcode-master

Opengraph URL: https://github.com/hopeforcode/leetcode-master

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:842b8238-1384-0cc2-1774-73ac3171f43e
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	B55A:6435C:74B628B:A36E573:6A50097A
html-safe-nonce	b7b62a7b8ca29a62e612bb5e6b3cd69f7549ccabcecc50018a419974d555d04c
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCNTVBOjY0MzVDOjc0QjYyOEI6QTM2RTU3Mzo2QTUwMDk3QSIsInZpc2l0b3JfaWQiOiI4Nzk5NTEwODM0NDExNzM1NDE4IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac	746f9dbb3cb273901844cb9fab31565b1966fde0d332efdf06226650d5c9ba15
hovercard-subject-tag	repository:514553664
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/hopeforcode/leetcode-master
twitter:image	https://opengraph.githubassets.com/120a9bbb66f26f193f98bcb33fcd5185f290a3518d16dddcb1e5ae9bf27bcb14/hopeforcode/leetcode-master
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/120a9bbb66f26f193f98bcb33fcd5185f290a3518d16dddcb1e5ae9bf27bcb14/hopeforcode/leetcode-master
og:image:alt	《代码随想录》LeetCode 刷题攻略：200道经典题目刷题顺序，共60w字的详细图解，视频难点剖析，50余张思维导图，支持C++，Java，Python，Go，JavaScript等多语言版本，从此算法学习不再迷茫！🔥🔥 来看看，你会发现相见恨晚！🚀 - hopeforcode/leetcode-master
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	56eec25a3430492dd6ec2a480eb33256a0da5192d5714b0db4f5ab5f33203d94
turbo-cache-control	no-cache
go-import	github.com/hopeforcode/leetcode-master git https://github.com/hopeforcode/leetcode-master.git
octolytics-dimension-user_id	59590455
octolytics-dimension-user_login	hopeforcode
octolytics-dimension-repository_id	514553664
octolytics-dimension-repository_nwo	hopeforcode/leetcode-master
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	228016443
octolytics-dimension-repository_parent_nwo	youngyangyang04/leetcode-master
octolytics-dimension-repository_network_root_id	228016443
octolytics-dimension-repository_network_root_nwo	youngyangyang04/leetcode-master
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	93a615b89b7dcbdb6b678f4772931ecc28ada82a
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/hopeforcode/leetcode-master#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fhopeforcode%2Fleetcode-master
GitHub CopilotWrite better code with AI	https://github.com/features/copilot
GitHub Copilot appDirect agents from issue to merge	https://github.com/features/ai/github-app
MCP RegistryNewIntegrate external tools	https://github.com/mcp
ActionsAutomate any workflow	https://github.com/features/actions
CodespacesInstant dev environments	https://github.com/features/codespaces
IssuesPlan and track work	https://github.com/features/issues
Code ReviewManage code changes	https://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilities	https://github.com/security/advanced-security
Code securitySecure your code as you build	https://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they start	https://github.com/security/advanced-security/secret-protection
Why GitHub	https://github.com/why-github
Documentation	https://docs.github.com
Blog	https://github.blog
Changelog	https://github.blog/changelog
Marketplace	https://github.com/marketplace
View all features	https://github.com/features
Enterprises	https://github.com/enterprise
Small and medium teams	https://github.com/team
Startups	https://github.com/enterprise/startups
Nonprofits	https://github.com/solutions/industry/nonprofits
App Modernization	https://github.com/solutions/use-case/app-modernization
DevSecOps	https://github.com/solutions/use-case/devsecops
DevOps	https://github.com/solutions/use-case/devops
CI/CD	https://github.com/solutions/use-case/ci-cd
View all use cases	https://github.com/solutions/use-case
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
View all industries	https://github.com/solutions/industry
View all solutions	https://github.com/solutions
AI	https://github.com/resources/articles?topic=ai
Software Development	https://github.com/resources/articles?topic=software-development
DevOps	https://github.com/resources/articles?topic=devops
Security	https://github.com/resources/articles?topic=security
View all topics	https://github.com/resources/articles
Customer stories	https://github.com/customer-stories
Events & webinars	https://github.com/resources/events
Ebooks & reports	https://github.com/resources/whitepapers
Business insights	https://github.com/solutions/executive-insights
GitHub Skills	https://skills.github.com
Documentation	https://docs.github.com
Customer support	https://support.github.com
Community forum	https://github.com/orgs/community/discussions
Trust center	https://github.com/trust-center
Partners	https://github.com/partners
View all resources	https://github.com/resources
GitHub SponsorsFund open source developers	https://github.com/open-source/sponsors
Security Lab	https://securitylab.github.com
Maintainer Community	https://maintainers.github.com
Accelerator	https://github.com/open-source/accelerator
GitHub Stars	https://stars.github.com
Archive Program	https://archiveprogram.github.com
Topics	https://github.com/topics
Trending	https://github.com/trending
Collections	https://github.com/collections
Enterprise platformAI-powered developer platform	https://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security features	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
Pricing	https://github.com/pricing
Search syntax tips	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentation	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fhopeforcode%2Fleetcode-master
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=hopeforcode%2Fleetcode-master
Reload	https://github.com/hopeforcode/leetcode-master
Reload	https://github.com/hopeforcode/leetcode-master
Reload	https://github.com/hopeforcode/leetcode-master
hopeforcode	https://github.com/hopeforcode
leetcode-master	https://github.com/hopeforcode/leetcode-master
youngyangyang04/leetcode-master	https://github.com/youngyangyang04/leetcode-master
Notifications	https://github.com/login?return_to=%2Fhopeforcode%2Fleetcode-master
Fork 0	https://github.com/login?return_to=%2Fhopeforcode%2Fleetcode-master
Star 0	https://github.com/login?return_to=%2Fhopeforcode%2Fleetcode-master
Code	https://github.com/hopeforcode/leetcode-master
Pull requests 0	https://github.com/hopeforcode/leetcode-master/pulls
Actions	https://github.com/hopeforcode/leetcode-master/actions
Projects	https://github.com/hopeforcode/leetcode-master/projects
Security and quality 0	https://github.com/hopeforcode/leetcode-master/security
Insights	https://github.com/hopeforcode/leetcode-master/pulse
Code	https://github.com/hopeforcode/leetcode-master
Pull requests	https://github.com/hopeforcode/leetcode-master/pulls
Actions	https://github.com/hopeforcode/leetcode-master/actions
Projects	https://github.com/hopeforcode/leetcode-master/projects
Security and quality	https://github.com/hopeforcode/leetcode-master/security
Insights	https://github.com/hopeforcode/leetcode-master/pulse
	https://github.com/hopeforcode/leetcode-master
Branches	https://github.com/hopeforcode/leetcode-master/branches
Tags	https://github.com/hopeforcode/leetcode-master/tags
	https://github.com/hopeforcode/leetcode-master/branches
	https://github.com/hopeforcode/leetcode-master/tags
4,911 Commits	https://github.com/hopeforcode/leetcode-master/commits/master/
	https://github.com/hopeforcode/leetcode-master/commits/master/
pics	https://github.com/hopeforcode/leetcode-master/tree/master/pics
pics	https://github.com/hopeforcode/leetcode-master/tree/master/pics
problems	https://github.com/hopeforcode/leetcode-master/tree/master/problems
problems	https://github.com/hopeforcode/leetcode-master/tree/master/problems
README.md	https://github.com/hopeforcode/leetcode-master/blob/master/README.md
README.md	https://github.com/hopeforcode/leetcode-master/blob/master/README.md
README	https://github.com/hopeforcode/leetcode-master
在线阅读	http://programmercarl.com/
Gitee同步	https://gitee.com/programmercarl/leetcode-master
关注作者	https://github.com/hopeforcode/leetcode-master#%E5%85%B3%E4%BA%8E%E4%BD%9C%E8%80%85
「代码随想录」算法精讲 PDF 版本	https://programmercarl.com/other/algo_pdf.html
代码随想录知识星球精华PDF	https://www.programmercarl.com/other/kstar_baguwen.html
「代码随想录」知识星球	https://programmercarl.com/other/kstar.html
这里的每一位贡献者	https://github.com/youngyangyang04/leetcode-master/graphs/contributors
点击这里	https://mp.weixin.qq.com/s/tqCxrMEU-ajQumL1i8im9A
程序员Carl	https://github.com/youngyangyang04
	https://github.com/hopeforcode/leetcode-master/blob/master/programmercarl.com
	https://mp.weixin.qq.com/s/RsdcQ9umo09R6cfnwXZlrQ
	https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw
	https://space.bilibili.com/525438321
	https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ
点击这里	https://programmercarl.com/other/publish.html
	https://union-click.jd.com/jdc?e=&p=JF8BAMQJK1olXg8EUVhVCkkWAV8IGV8WVAICU24ZVxNJXF9RXh5UHw0cSgYYXBcIWDoXSQVJQwYAUF1UDEsQHDZNRwYlX0B9A1cfakpyYBkSRj4QKFBUEEAfaEcbM244GFIXWQYAUV5VOHsXBF9edVsUXAcDVVtdDUgnAl8IHFkdXw8KUl5fDkgRM2gIEmtIFVpKAxVtOHsUM184G2sWbURsVApfAR8XA2sLSw8cWA8LUw1ZCElHAmhdTAxGW1YBUlxtCkoWB2Y4
	https://github.com/hopeforcode/leetcode-master#leetcode-刷题攻略
	https://github.com/hopeforcode/leetcode-master#刷题攻略的背景
	https://github.com/hopeforcode/leetcode-master/blob/master/pics/公众号二维码.jpg
	https://github.com/hopeforcode/leetcode-master#如何使用该刷题攻略
「代码随想录」	https://img-blog.csdnimg.cn/20201124161234338.png
热心小伙们	https://github.com/youngyangyang04/leetcode-master/graphs/contributors
	https://github.com/hopeforcode/leetcode-master#前序
「代码随想录」学习社区	https://programmercarl.com/other/kstar.html
C++面试&C++学习指南知识点整理	https://github.com/youngyangyang04/TechCPP
基于跳表的轻量级KV存储引擎	https://github.com/youngyangyang04/Skiplist-CPP
Nosql数据库注入攻击系统	https://github.com/youngyangyang04/NoSQLAttack
看了这么多代码，谈一谈代码风格！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E4%BB%A3%E7%A0%81%E9%A3%8E%E6%A0%BC.md
力扣上的代码想在本地编译运行？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%8A%9B%E6%89%A3%E4%B8%8A%E7%9A%84%E4%BB%A3%E7%A0%81%E6%83%B3%E5%9C%A8%E6%9C%AC%E5%9C%B0%E7%BC%96%E8%AF%91%E8%BF%90%E8%A1%8C%EF%BC%9F.md
什么是核心代码模式，什么又是ACM模式？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E4%BB%80%E4%B9%88%E6%98%AF%E6%A0%B8%E5%BF%83%E4%BB%A3%E7%A0%81%E6%A8%A1%E5%BC%8F%EF%BC%8C%E4%BB%80%E4%B9%88%E5%8F%88%E6%98%AFACM%E6%A8%A1%E5%BC%8F%EF%BC%9F.md
刷题要不要用库函数	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%88%B7%E5%8A%9B%E6%89%A3%E7%94%A8%E4%B8%8D%E7%94%A8%E5%BA%93%E5%87%BD%E6%95%B0.md
ACM模式如何构造二叉树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/ACM%E6%A8%A1%E5%BC%8F%E5%A6%82%E4%BD%95%E6%9E%84%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md
解密互联网大厂研发流程	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E4%BA%92%E8%81%94%E7%BD%91%E5%A4%A7%E5%8E%82%E7%A0%94%E5%8F%91%E6%B5%81%E7%A8%8B.md
一站式vim配置	https://github.com/youngyangyang04/PowerVim
保姆级Git入门教程，万字详解	https://mp.weixin.qq.com/s/Q_O0ey4C9tryPZaZeJocbA
程序员应该用什么用具来写文档？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E7%A8%8B%E5%BA%8F%E5%91%98%E5%86%99%E6%96%87%E6%A1%A3%E5%B7%A5%E5%85%B7.md
程序员的简历应该这么写！！（附简历模板）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E7%A8%8B%E5%BA%8F%E5%91%98%E7%AE%80%E5%8E%86.md
BAT级别技术面试流程和注意事项都在这里了	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/BAT%E7%BA%A7%E5%88%AB%E6%8A%80%E6%9C%AF%E9%9D%A2%E8%AF%95%E6%B5%81%E7%A8%8B%E5%92%8C%E6%B3%A8%E6%84%8F%E4%BA%8B%E9%A1%B9%E9%83%BD%E5%9C%A8%E8%BF%99%E9%87%8C%E4%BA%86.md
北京有这些互联网公司，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%8C%97%E4%BA%AC%E4%BA%92%E8%81%94%E7%BD%91%E5%85%AC%E5%8F%B8%E6%80%BB%E7%BB%93.md
上海有这些互联网公司，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E4%B8%8A%E6%B5%B7%E4%BA%92%E8%81%94%E7%BD%91%E5%85%AC%E5%8F%B8%E6%80%BB%E7%BB%93.md
深圳有这些互联网公司，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E6%B7%B1%E5%9C%B3%E4%BA%92%E8%81%94%E7%BD%91%E5%85%AC%E5%8F%B8%E6%80%BB%E7%BB%93.md
广州有这些互联网公司，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%B9%BF%E5%B7%9E%E4%BA%92%E8%81%94%E7%BD%91%E5%85%AC%E5%8F%B8%E6%80%BB%E7%BB%93.md
成都有这些互联网公司，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E6%88%90%E9%83%BD%E4%BA%92%E8%81%94%E7%BD%91%E5%85%AC%E5%8F%B8%E6%80%BB%E7%BB%93.md
杭州有这些互联网公司，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E6%9D%AD%E5%B7%9E%E4%BA%92%E8%81%94%E7%BD%91%E5%85%AC%E5%8F%B8%E6%80%BB%E7%BB%93.md
关于时间复杂度，你不知道的都在这里！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%85%B3%E4%BA%8E%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%EF%BC%8C%E4%BD%A0%E4%B8%8D%E7%9F%A5%E9%81%93%E7%9A%84%E9%83%BD%E5%9C%A8%E8%BF%99%E9%87%8C%EF%BC%81.md
O(n)的算法居然超时了，此时的n究竟是多大？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/On%E7%9A%84%E7%AE%97%E6%B3%95%E5%B1%85%E7%84%B6%E8%B6%85%E6%97%B6%E4%BA%86%EF%BC%8C%E6%AD%A4%E6%97%B6%E7%9A%84n%E7%A9%B6%E7%AB%9F%E6%98%AF%E5%A4%9A%E5%A4%A7%EF%BC%9F.md
通过一道面试题目，讲一讲递归算法的时间复杂度！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E9%80%9A%E8%BF%87%E4%B8%80%E9%81%93%E9%9D%A2%E8%AF%95%E9%A2%98%E7%9B%AE%EF%BC%8C%E8%AE%B2%E4%B8%80%E8%AE%B2%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95%E7%9A%84%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%EF%BC%81.md
本周小结！（算法性能分析系列一）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201210%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
关于空间复杂度，可能有几个疑问？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%85%B3%E4%BA%8E%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%EF%BC%8C%E5%8F%AF%E8%83%BD%E6%9C%89%E5%87%A0%E4%B8%AA%E7%96%91%E9%97%AE%EF%BC%9F.md
递归算法的时间与空间复杂度分析！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95%E7%9A%84%E6%97%B6%E9%97%B4%E4%B8%8E%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%E5%88%86%E6%9E%90.md
刷了这么多题，你了解自己代码的内存消耗么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%8D%E5%BA%8F/%E5%88%B7%E4%BA%86%E8%BF%99%E4%B9%88%E5%A4%9A%E9%A2%98%EF%BC%8C%E4%BD%A0%E4%BA%86%E8%A7%A3%E8%87%AA%E5%B7%B1%E4%BB%A3%E7%A0%81%E7%9A%84%E5%86%85%E5%AD%98%E6%B6%88%E8%80%97%E4%B9%88%EF%BC%9F.md
	https://github.com/hopeforcode/leetcode-master#杂谈
「代码随想录」刷题网站上线	https://mp.weixin.qq.com/s/-6rd_g7LrVD1fuKBYk2tXQ
LeetCode-Master上榜了	https://mp.weixin.qq.com/s/wZRTrA9Rbvgq1yEkSw4vfQ
上榜之后，都有哪些变化？	https://mp.weixin.qq.com/s/VJBV0qSBthjnbbmW-lctLA
大半年过去了......	https://mp.weixin.qq.com/s/lubfeistPxBLSQIe5XYg5g
一万录友在B站学算法！	https://mp.weixin.qq.com/s/Vzq4zkMZY7erKeu0fqGLgw
	https://github.com/hopeforcode/leetcode-master#数组
数组过于简单，但你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E6%95%B0%E7%BB%84%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
数组：每次遇到二分法，都是一看就会，一写就废	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0704.%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.md
数组：就移除个元素很难么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0027.%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md
数组：有序数组的平方，还有序么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0977.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.md
数组：滑动窗口拯救了你	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0209.%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.md
数组：这个循环可以转懵很多人！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0059.%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5II.md
数组：总结篇	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E6%95%B0%E7%BB%84%E6%80%BB%E7%BB%93%E7%AF%87.md
	https://github.com/hopeforcode/leetcode-master#链表
关于链表，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E9%93%BE%E8%A1%A8%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
链表：听说用虚拟头节点会方便很多？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0203.%E7%A7%BB%E9%99%A4%E9%93%BE%E8%A1%A8%E5%85%83%E7%B4%A0.md
链表：一道题目考察了常见的五个操作！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0707.%E8%AE%BE%E8%AE%A1%E9%93%BE%E8%A1%A8.md
链表：听说过两天反转链表又写不出来了？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0206.%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md
链表：两两交换链表中的节点	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0024.%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md
链表：删除链表的倒数第 N 个结点	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0019.%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACN%E4%B8%AA%E8%8A%82%E7%82%B9.md
链表：链表相交	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E9%9D%A2%E8%AF%95%E9%A2%9802.07.%E9%93%BE%E8%A1%A8%E7%9B%B8%E4%BA%A4.md
链表：环找到了，那入口呢？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0142.%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8II.md
链表：总结篇！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E9%93%BE%E8%A1%A8%E6%80%BB%E7%BB%93%E7%AF%87.md
	https://github.com/hopeforcode/leetcode-master#哈希表
关于哈希表，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%93%88%E5%B8%8C%E8%A1%A8%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
哈希表：可以拿数组当哈希表来用，但哈希值不要太大	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0242.%E6%9C%89%E6%95%88%E7%9A%84%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D.md
哈希表：查找常用字符	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1002.%E6%9F%A5%E6%89%BE%E5%B8%B8%E7%94%A8%E5%AD%97%E7%AC%A6.md
哈希表：哈希值太大了，还是得用set	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0349.%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.md
哈希表：用set来判断快乐数	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0202.%E5%BF%AB%E4%B9%90%E6%95%B0.md
哈希表：map等候多时了	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0001.%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md
哈希表：其实需要哈希的地方都能找到map的身影	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0454.%E5%9B%9B%E6%95%B0%E7%9B%B8%E5%8A%A0II.md
哈希表：这道题目我做过？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0383.%E8%B5%8E%E9%87%91%E4%BF%A1.md
哈希表：解决了两数之和，那么能解决三数之和么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0015.%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md
双指针法：一样的道理，能解决四数之和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0018.%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md
哈希表：总结篇！（每逢总结必经典）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%93%88%E5%B8%8C%E8%A1%A8%E6%80%BB%E7%BB%93.md
	https://github.com/hopeforcode/leetcode-master#字符串
字符串：这道题目，使用库函数一行代码搞定	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0344.%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md
字符串：简单的反转还不够！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0541.%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2II.md
字符串：替换空格	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%91%E6%8C%87Offer05.%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md
字符串：花式反转还不够！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0151.%E7%BF%BB%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%87%8C%E7%9A%84%E5%8D%95%E8%AF%8D.md
字符串：反转个字符串还有这个用处？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%91%E6%8C%87Offer58-II.%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md
帮你把KMP算法学个通透	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0028.%E5%AE%9E%E7%8E%B0strStr.md
字符串：KMP算法还能干这个！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0459.%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.md
字符串：总结篇！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%80%BB%E7%BB%93.md
	https://github.com/hopeforcode/leetcode-master#双指针法
数组：就移除个元素很难么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0027.%E7%A7%BB%E9%99%A4%E5%85%83%E7%B4%A0.md
字符串：这道题目，使用库函数一行代码搞定	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0344.%E5%8F%8D%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md
字符串：替换空格	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%89%91%E6%8C%87Offer05.%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md
字符串：花式反转还不够！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0151.%E7%BF%BB%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%87%8C%E7%9A%84%E5%8D%95%E8%AF%8D.md
链表：听说过两天反转链表又写不出来了？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0206.%E7%BF%BB%E8%BD%AC%E9%93%BE%E8%A1%A8.md
链表：删除链表的倒数第 N 个结点	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0019.%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACN%E4%B8%AA%E8%8A%82%E7%82%B9.md
链表：链表相交	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E9%9D%A2%E8%AF%95%E9%A2%9802.07.%E9%93%BE%E8%A1%A8%E7%9B%B8%E4%BA%A4.md
链表：环找到了，那入口呢？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0142.%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8II.md
哈希表：解决了两数之和，那么能解决三数之和么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0015.%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md
双指针法：一样的道理，能解决四数之和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0018.%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md
双指针法：总结篇！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%8F%8C%E6%8C%87%E9%92%88%E6%80%BB%E7%BB%93.md
	https://github.com/hopeforcode/leetcode-master#栈与队列
栈与队列：来看看栈和队列不为人知的一面	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
栈与队列：我用栈来实现队列怎么样？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0232.%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md
栈与队列：用队列实现栈还有点别扭	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0225.%E7%94%A8%E9%98%9F%E5%88%97%E5%AE%9E%E7%8E%B0%E6%A0%88.md
栈与队列：系统中处处都是栈的应用	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0020.%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md
栈与队列：匹配问题都是栈的强项	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1047.%E5%88%A0%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%89%80%E6%9C%89%E7%9B%B8%E9%82%BB%E9%87%8D%E5%A4%8D%E9%A1%B9.md
栈与队列：有没有想过计算机是如何处理表达式的？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0150.%E9%80%86%E6%B3%A2%E5%85%B0%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%B1%82%E5%80%BC.md
栈与队列：滑动窗口里求最大值引出一个重要数据结构	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0239.%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E6%9C%80%E5%A4%A7%E5%80%BC.md
栈与队列：求前 K 个高频元素和队列有啥关系？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0347.%E5%89%8DK%E4%B8%AA%E9%AB%98%E9%A2%91%E5%85%83%E7%B4%A0.md
栈与队列：总结篇！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97%E6%80%BB%E7%BB%93.md
	https://github.com/hopeforcode/leetcode-master#二叉树
	https://camo.githubusercontent.com/8602b2ce05b22f37a6fe65e7c24a3e4044c5528ebd8b5319b0ee3847cdd2a58d/68747470733a2f2f696d672d626c6f672e6373646e696d672e636e2f32303231303231393139303830393435312e706e67
关于二叉树，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
二叉树：一入递归深似海，从此offer是路人	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%80%92%E5%BD%92%E9%81%8D%E5%8E%86.md
二叉树：听说递归能做的，栈也能做！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%BF%AD%E4%BB%A3%E9%81%8D%E5%8E%86.md
二叉树：前中后序迭代方式的写法就不能统一一下么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%BB%9F%E4%B8%80%E8%BF%AD%E4%BB%A3%E6%B3%95.md
二叉树：层序遍历登场！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0102.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.md
二叉树：你真的会翻转二叉树么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0226.%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.md
本周小结！（二叉树）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20200927%E4%BA%8C%E5%8F%89%E6%A0%91%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
二叉树：我对称么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0101.%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md
二叉树：看看这些树的最大深度	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0104.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%A4%A7%E6%B7%B1%E5%BA%A6.md
二叉树：看看这些树的最小深度	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0111.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md
二叉树：我有多少个节点？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0222.%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E8%8A%82%E7%82%B9%E4%B8%AA%E6%95%B0.md
二叉树：我平衡么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0110.%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md
二叉树：找我的所有路径？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0257.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%89%80%E6%9C%89%E8%B7%AF%E5%BE%84.md
本周总结！二叉树系列二	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201003%E4%BA%8C%E5%8F%89%E6%A0%91%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
二叉树：以为使用了递归，其实还隐藏着回溯	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E9%80%92%E5%BD%92%E5%B8%A6%E7%9D%80%E5%9B%9E%E6%BA%AF.md
二叉树：做了这么多题目了，我的左叶子之和是多少？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0404.%E5%B7%A6%E5%8F%B6%E5%AD%90%E4%B9%8B%E5%92%8C.md
二叉树：我的左下角的值是多少？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0513.%E6%89%BE%E6%A0%91%E5%B7%A6%E4%B8%8B%E8%A7%92%E7%9A%84%E5%80%BC.md
二叉树：路径总和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0112.%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C.md
二叉树：构造二叉树登场！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0106.%E4%BB%8E%E4%B8%AD%E5%BA%8F%E4%B8%8E%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.md
二叉树：构造一棵最大的二叉树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0654.%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md
本周小结！（二叉树系列三）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201010%E4%BA%8C%E5%8F%89%E6%A0%91%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
二叉树：合并两个二叉树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0617.%E5%90%88%E5%B9%B6%E4%BA%8C%E5%8F%89%E6%A0%91.md
二叉树：二叉搜索树登场！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0700.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%90%9C%E7%B4%A2.md
二叉树：我是不是一棵二叉搜索树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0098.%E9%AA%8C%E8%AF%81%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md
二叉树：搜索树的最小绝对差	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0530.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BB%9D%E5%AF%B9%E5%B7%AE.md
二叉树：我的众数是多少？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0501.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%97%E6%95%B0.md
二叉树：公共祖先问题	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0236.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md
本周小结！（二叉树系列四）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201017%E4%BA%8C%E5%8F%89%E6%A0%91%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
二叉树：搜索树的公共祖先问题	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0235.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md
二叉树：搜索树中的插入操作	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0701.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E6%8F%92%E5%85%A5%E6%93%8D%E4%BD%9C.md
二叉树：搜索树中的删除操作	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0450.%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md
二叉树：修剪一棵搜索树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0669.%E4%BF%AE%E5%89%AA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md
二叉树：构造一棵搜索树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0108.%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md
二叉树：搜索树转成累加树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0538.%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E8%BD%AC%E6%8D%A2%E4%B8%BA%E7%B4%AF%E5%8A%A0%E6%A0%91.md
二叉树：总结篇！（需要掌握的二叉树技能都在这里了）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%BA%8C%E5%8F%89%E6%A0%91%E6%80%BB%E7%BB%93%E7%AF%87.md
	https://github.com/hopeforcode/leetcode-master#回溯算法
	https://camo.githubusercontent.com/d62b7bbaf60a6e17a1f25aee3c1fb76a30e04503bf0d09b53199eaf6a1b3273d/68747470733a2f2f696d672d626c6f672e6373646e696d672e636e2f32303231303231393139323035303636362e706e67
关于回溯算法，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
回溯算法：组合问题	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0077.%E7%BB%84%E5%90%88.md
回溯算法：组合问题再剪剪枝	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0077.%E7%BB%84%E5%90%88%E4%BC%98%E5%8C%96.md
回溯算法：求组合总和！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0216.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8CIII.md
回溯算法：电话号码的字母组合	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0017.%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md
本周小结！（回溯算法系列一）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201030%E5%9B%9E%E6%BA%AF%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
回溯算法：求组合总和（二）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0039.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.md
回溯算法：求组合总和（三）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0040.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8CII.md
回溯算法：分割回文串	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0131.%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2.md
回溯算法：复原IP地址	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0093.%E5%A4%8D%E5%8E%9FIP%E5%9C%B0%E5%9D%80.md
回溯算法：求子集问题！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0078.%E5%AD%90%E9%9B%86.md
本周小结！（回溯算法系列二）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201107%E5%9B%9E%E6%BA%AF%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
回溯算法：求子集问题（二）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0090.%E5%AD%90%E9%9B%86II.md
回溯算法：递增子序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0491.%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.md
回溯算法：排列问题！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0046.%E5%85%A8%E6%8E%92%E5%88%97.md
回溯算法：排列问题（二）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0047.%E5%85%A8%E6%8E%92%E5%88%97II.md
本周小结！（回溯算法系列三）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201112%E5%9B%9E%E6%BA%AF%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
回溯算法去重问题的另一种写法	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E5%8E%BB%E9%87%8D%E9%97%AE%E9%A2%98%E7%9A%84%E5%8F%A6%E4%B8%80%E7%A7%8D%E5%86%99%E6%B3%95.md
回溯算法：重新安排行程	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0332.%E9%87%8D%E6%96%B0%E5%AE%89%E6%8E%92%E8%A1%8C%E7%A8%8B.md
回溯算法：N皇后问题	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0051.N%E7%9A%87%E5%90%8E.md
回溯算法：解数独	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0037.%E8%A7%A3%E6%95%B0%E7%8B%AC.md
一篇总结带你彻底搞透回溯算法！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%9B%9E%E6%BA%AF%E6%80%BB%E7%BB%93.md
	https://github.com/hopeforcode/leetcode-master#贪心算法
	https://camo.githubusercontent.com/9d6d5e27198d02f3b66b75cc21ca6bb82f04ed081db2ce8dd975c3c61b4705d6/68747470733a2f2f636f64652d7468696e6b696e672d313235333835353039332e66696c652e6d7971636c6f75642e636f6d2f706963732f32303231303931373130343331352e706e67
关于贪心算法，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
贪心算法：分发饼干	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0455.%E5%88%86%E5%8F%91%E9%A5%BC%E5%B9%B2.md
贪心算法：摆动序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0376.%E6%91%86%E5%8A%A8%E5%BA%8F%E5%88%97.md
贪心算法：最大子序和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0053.%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%92%8C.md
本周小结！（贪心算法系列一）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201126%E8%B4%AA%E5%BF%83%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
贪心算法：买卖股票的最佳时机II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0122.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAII.md
贪心算法：跳跃游戏	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0055.%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.md
贪心算法：跳跃游戏II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0045.%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8FII.md
贪心算法：K次取反后最大化的数组和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1005.K%E6%AC%A1%E5%8F%96%E5%8F%8D%E5%90%8E%E6%9C%80%E5%A4%A7%E5%8C%96%E7%9A%84%E6%95%B0%E7%BB%84%E5%92%8C.md
本周小结！（贪心算法系列二）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201203%E8%B4%AA%E5%BF%83%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
贪心算法：加油站	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0134.%E5%8A%A0%E6%B2%B9%E7%AB%99.md
贪心算法：分发糖果	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0135.%E5%88%86%E5%8F%91%E7%B3%96%E6%9E%9C.md
贪心算法：柠檬水找零	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0860.%E6%9F%A0%E6%AA%AC%E6%B0%B4%E6%89%BE%E9%9B%B6.md
贪心算法：根据身高重建队列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0406.%E6%A0%B9%E6%8D%AE%E8%BA%AB%E9%AB%98%E9%87%8D%E5%BB%BA%E9%98%9F%E5%88%97.md
本周小结！（贪心算法系列三）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201217%E8%B4%AA%E5%BF%83%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
贪心算法：根据身高重建队列（续集）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E6%A0%B9%E6%8D%AE%E8%BA%AB%E9%AB%98%E9%87%8D%E5%BB%BA%E9%98%9F%E5%88%97%EF%BC%88vector%E5%8E%9F%E7%90%86%E8%AE%B2%E8%A7%A3%EF%BC%89.md
贪心算法：用最少数量的箭引爆气球	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0452.%E7%94%A8%E6%9C%80%E5%B0%91%E6%95%B0%E9%87%8F%E7%9A%84%E7%AE%AD%E5%BC%95%E7%88%86%E6%B0%94%E7%90%83.md
贪心算法：无重叠区间	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0435.%E6%97%A0%E9%87%8D%E5%8F%A0%E5%8C%BA%E9%97%B4.md
贪心算法：划分字母区间	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0763.%E5%88%92%E5%88%86%E5%AD%97%E6%AF%8D%E5%8C%BA%E9%97%B4.md
贪心算法：合并区间	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0056.%E5%90%88%E5%B9%B6%E5%8C%BA%E9%97%B4.md
本周小结！（贪心算法系列四）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20201224%E8%B4%AA%E5%BF%83%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
贪心算法：单调递增的数字	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0738.%E5%8D%95%E8%B0%83%E9%80%92%E5%A2%9E%E7%9A%84%E6%95%B0%E5%AD%97.md
贪心算法：买卖股票的最佳时机含手续费	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0714.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9.md
贪心算法：我要监控二叉树！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0968.%E7%9B%91%E6%8E%A7%E4%BA%8C%E5%8F%89%E6%A0%91.md
贪心算法：总结篇！（每逢总结必经典）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E6%80%BB%E7%BB%93%E7%AF%87.md
	https://github.com/hopeforcode/leetcode-master#动态规划
	https://camo.githubusercontent.com/9586fdbd1f9b4666fc52eb4a79351fb6fb41fa2c3a2eb0f0f58aefd1a131cd1a/68747470733a2f2f636f64652d7468696e6b696e672e63646e2e626365626f732e636f6d2f706963732fe58aa8e68081e8a784e588922de680bbe7bb93e5a4a7e7bab2312e6a7067
关于动态规划，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md
动态规划：斐波那契数	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0509.%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0.md
动态规划：爬楼梯	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0070.%E7%88%AC%E6%A5%BC%E6%A2%AF.md
动态规划：使用最小花费爬楼梯	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0746.%E4%BD%BF%E7%94%A8%E6%9C%80%E5%B0%8F%E8%8A%B1%E8%B4%B9%E7%88%AC%E6%A5%BC%E6%A2%AF.md
本周小结！（动态规划系列一）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210107%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
动态规划：不同路径	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0062.%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md
动态规划：不同路径还不够，要有障碍！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0063.%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84II.md
动态规划：整数拆分，你要怎么拆？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0343.%E6%95%B4%E6%95%B0%E6%8B%86%E5%88%86.md
动态规划：不同的二叉搜索树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0096.%E4%B8%8D%E5%90%8C%E7%9A%84%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md
本周小结！（动态规划系列二）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210114%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
	https://camo.githubusercontent.com/b23eebaf964d4e6ae8d51a231f296bea4be1275848ee3bac47c923d0b1fcfa14/68747470733a2f2f636f64652d7468696e6b696e672e63646e2e626365626f732e636f6d2f706963732fe58aa8e68081e8a784e588922de8838ce58c85e997aee9a298e680bbe7bb932e706e67
动态规划：关于01背包问题，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%83%8C%E5%8C%85%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%8001%E8%83%8C%E5%8C%85-1.md
动态规划：关于01背包问题，你该了解这些！（滚动数组）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%83%8C%E5%8C%85%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%8001%E8%83%8C%E5%8C%85-2.md
动态规划：分割等和子集可以用01背包！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0416.%E5%88%86%E5%89%B2%E7%AD%89%E5%92%8C%E5%AD%90%E9%9B%86.md
动态规划：最后一块石头的重量 II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1049.%E6%9C%80%E5%90%8E%E4%B8%80%E5%9D%97%E7%9F%B3%E5%A4%B4%E7%9A%84%E9%87%8D%E9%87%8FII.md
本周小结！（动态规划系列三）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210121%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
动态规划：目标和！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0494.%E7%9B%AE%E6%A0%87%E5%92%8C.md
动态规划：一和零！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0474.%E4%B8%80%E5%92%8C%E9%9B%B6.md
动态规划：关于完全背包，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85.md
动态规划：给你一些零钱，你要怎么凑？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0518.%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2II.md
本周小结！（动态规划系列四）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210128%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
动态规划：Carl称它为排列总和！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0377.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C%E2%85%A3.md
动态规划：以前我没得选，现在我选择再爬一次！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0070.%E7%88%AC%E6%A5%BC%E6%A2%AF%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E7%89%88%E6%9C%AC.md
动态规划：给我个机会，我再兑换一次零钱	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0322.%E9%9B%B6%E9%92%B1%E5%85%91%E6%8D%A2.md
动态规划：一样的套路，再求一次完全平方数	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0279.%E5%AE%8C%E5%85%A8%E5%B9%B3%E6%96%B9%E6%95%B0.md
本周小结！（动态规划系列五）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210204%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
动态规划：单词拆分	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0139.%E5%8D%95%E8%AF%8D%E6%8B%86%E5%88%86.md
动态规划：关于多重背包，你该了解这些！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85.md
听说背包问题很难？这篇总结篇来拯救你了	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E8%83%8C%E5%8C%85%E6%80%BB%E7%BB%93%E7%AF%87.md
动态规划：开始打家劫舍！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0198.%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D.md
动态规划：继续打家劫舍！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0213.%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8DII.md
动态规划：还要打家劫舍！	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0337.%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8DIII.md
	https://camo.githubusercontent.com/bf61a83b931669267127b4497e1a4e4a7f9f15f9a6eb74b73c663694fdcbe239/68747470733a2f2f636f64652d7468696e6b696e672e63646e2e626365626f732e636f6d2f706963732fe882a1e7a5a8e997aee9a298e680bbe7bb932e6a7067
动态规划：买卖股票的最佳时机	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0121.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md
动态规划：本周我们都讲了这些（系列六）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210225%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
动态规划：买卖股票的最佳时机II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0122.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAII%EF%BC%88%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%EF%BC%89.md
动态规划：买卖股票的最佳时机III	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0123.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAIII.md
动态规划：买卖股票的最佳时机IV	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0188.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAIV.md
动态规划：最佳买卖股票时机含冷冻期	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0309.%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.md
动态规划：本周我们都讲了这些（系列七）	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%91%A8%E6%80%BB%E7%BB%93/20210304%E5%8A%A8%E8%A7%84%E5%91%A8%E6%9C%AB%E6%80%BB%E7%BB%93.md
动态规划：买卖股票的最佳时机含手续费	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0714.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA%E5%90%AB%E6%89%8B%E7%BB%AD%E8%B4%B9%EF%BC%88%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%EF%BC%89.md
动态规划：股票系列总结篇	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92-%E8%82%A1%E7%A5%A8%E9%97%AE%E9%A2%98%E6%80%BB%E7%BB%93%E7%AF%87.md
	https://camo.githubusercontent.com/50fe787662501158d89aecd28584708be96939b1851ac7da20b6b9f6b86c0fdc/68747470733a2f2f636f64652d7468696e6b696e672e63646e2e626365626f732e636f6d2f706963732fe58aa8e68081e8a784e588922de5ad90e5ba8fe58897e997aee9a298e680bbe7bb932e6a7067
动态规划：最长递增子序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0300.%E6%9C%80%E9%95%BF%E4%B8%8A%E5%8D%87%E5%AD%90%E5%BA%8F%E5%88%97.md
动态规划：最长连续递增序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0674.%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E9%80%92%E5%A2%9E%E5%BA%8F%E5%88%97.md
动态规划：最长重复子数组	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0718.%E6%9C%80%E9%95%BF%E9%87%8D%E5%A4%8D%E5%AD%90%E6%95%B0%E7%BB%84.md
动态规划：最长公共子序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1143.%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97.md
动态规划：不相交的线	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1035.%E4%B8%8D%E7%9B%B8%E4%BA%A4%E7%9A%84%E7%BA%BF.md
动态规划：最大子序和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0053.%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%92%8C%EF%BC%88%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%EF%BC%89.md
动态规划：判断子序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0392.%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.md
动态规划：不同的子序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0115.%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.md
动态规划：两个字符串的删除操作	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0583.%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%88%A0%E9%99%A4%E6%93%8D%E4%BD%9C.md
动态规划：编辑距离	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0072.%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB.md
为了绝杀编辑距离，Carl做了三步铺垫，你都知道么？	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E4%B8%BA%E4%BA%86%E7%BB%9D%E6%9D%80%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB%EF%BC%8C%E5%8D%A1%E5%B0%94%E5%81%9A%E4%BA%86%E4%B8%89%E6%AD%A5%E9%93%BA%E5%9E%AB.md
动态规划：回文子串	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0647.%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md
动态规划：最长回文子序列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0516.%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E5%BA%8F%E5%88%97.md
动态规划总结篇	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E6%80%BB%E7%BB%93%E7%AF%87.md
	https://github.com/hopeforcode/leetcode-master#单调栈
单调栈：每日温度	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0739.%E6%AF%8F%E6%97%A5%E6%B8%A9%E5%BA%A6.md
单调栈：下一个更大元素I	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0496.%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0I.md
单调栈：下一个更大元素II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0503.%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0II.md
单调栈：接雨水	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0042.%E6%8E%A5%E9%9B%A8%E6%B0%B4.md
单调栈：柱状图中最大的矩形	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0084.%E6%9F%B1%E7%8A%B6%E5%9B%BE%E4%B8%AD%E6%9C%80%E5%A4%A7%E7%9A%84%E7%9F%A9%E5%BD%A2.md
	https://github.com/hopeforcode/leetcode-master#图论
	https://github.com/hopeforcode/leetcode-master#十大排序
	https://github.com/hopeforcode/leetcode-master#数论
	https://github.com/hopeforcode/leetcode-master#高级数据结构经典题目
	https://github.com/hopeforcode/leetcode-master#海量数据处理
	https://github.com/hopeforcode/leetcode-master#补充题目
	https://github.com/hopeforcode/leetcode-master#数组-1
1365.有多少小于当前数字的数字	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1365.%E6%9C%89%E5%A4%9A%E5%B0%91%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E6%95%B0%E5%AD%97%E7%9A%84%E6%95%B0%E5%AD%97.md
941.有效的山脉数组	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0941.%E6%9C%89%E6%95%88%E7%9A%84%E5%B1%B1%E8%84%89%E6%95%B0%E7%BB%84.md
1207.独一无二的出现次数	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1207.%E7%8B%AC%E4%B8%80%E6%97%A0%E4%BA%8C%E7%9A%84%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0.md
283.移动零	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0283.%E7%A7%BB%E5%8A%A8%E9%9B%B6.md
189.旋转数组	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0189.%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84.md
724.寻找数组的中心索引	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0724.%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E5%BF%83%E7%B4%A2%E5%BC%95.md
34.在排序数组中查找元素的第一个和最后一个位置	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0034.%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.md
922.按奇偶排序数组II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0922.%E6%8C%89%E5%A5%87%E5%81%B6%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84II.md
35.搜索插入位置	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0035.%E6%90%9C%E7%B4%A2%E6%8F%92%E5%85%A5%E4%BD%8D%E7%BD%AE.md
	https://github.com/hopeforcode/leetcode-master#链表-1
24.两两交换链表中的节点	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0024.%E4%B8%A4%E4%B8%A4%E4%BA%A4%E6%8D%A2%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md
234.回文链表	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0234.%E5%9B%9E%E6%96%87%E9%93%BE%E8%A1%A8.md
143.重排链表	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0143.%E9%87%8D%E6%8E%92%E9%93%BE%E8%A1%A8.md
141.环形链表	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0141.%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8.md
160.相交链表	https://github.com/hopeforcode/leetcode-master/blob/master/problems/%E9%9D%A2%E8%AF%95%E9%A2%9802.07.%E9%93%BE%E8%A1%A8%E7%9B%B8%E4%BA%A4.md
	https://github.com/hopeforcode/leetcode-master#哈希表-1
205.同构字符串	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0205.%E5%90%8C%E6%9E%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md
	https://github.com/hopeforcode/leetcode-master#字符串-1
925.长按键入	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0925.%E9%95%BF%E6%8C%89%E9%94%AE%E5%85%A5.md
0844.比较含退格的字符串	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0844.%E6%AF%94%E8%BE%83%E5%90%AB%E9%80%80%E6%A0%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md
	https://github.com/hopeforcode/leetcode-master#二叉树-1
129.求根到叶子节点数字之和	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0129.%E6%B1%82%E6%A0%B9%E5%88%B0%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E6%95%B0%E5%AD%97%E4%B9%8B%E5%92%8C.md
1382.将二叉搜索树变平衡	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1382.%E5%B0%86%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E5%8F%98%E5%B9%B3%E8%A1%A1.md
100.相同的树	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0100.%E7%9B%B8%E5%90%8C%E7%9A%84%E6%A0%91.md
116.填充每个节点的下一个右侧节点指针	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0116.%E5%A1%AB%E5%85%85%E6%AF%8F%E4%B8%AA%E8%8A%82%E7%82%B9%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E5%8F%B3%E4%BE%A7%E8%8A%82%E7%82%B9%E6%8C%87%E9%92%88.md
	https://github.com/hopeforcode/leetcode-master#回溯算法-1
52.N皇后II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0052.N%E7%9A%87%E5%90%8EII.md
	https://github.com/hopeforcode/leetcode-master#贪心
649.Dota2参议院	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0649.Dota2%E5%8F%82%E8%AE%AE%E9%99%A2.md
1221.分割平衡字符	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1221.%E5%88%86%E5%89%B2%E5%B9%B3%E8%A1%A1%E5%AD%97%E7%AC%A6%E4%B8%B2.md
	https://github.com/hopeforcode/leetcode-master#动态规划-1
5.最长回文子串	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0005.%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md
647.回文子串	https://mp.weixin.qq.com/s/2WetyP6IYQ6VotegepVpEw
132.分割回文串II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0132.%E5%88%86%E5%89%B2%E5%9B%9E%E6%96%87%E4%B8%B2II.md
673.最长递增子序列的个数	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0673.%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md
	https://github.com/hopeforcode/leetcode-master#图论-1
463.岛屿的周长	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0463.%E5%B2%9B%E5%B1%BF%E7%9A%84%E5%91%A8%E9%95%BF.md
841.钥匙和房间	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0841.%E9%92%A5%E5%8C%99%E5%92%8C%E6%88%BF%E9%97%B4.md
127.单词接龙	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0127.%E5%8D%95%E8%AF%8D%E6%8E%A5%E9%BE%99.md
	https://github.com/hopeforcode/leetcode-master#并查集
684.冗余连接	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0684.%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5.md
685.冗余连接II	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0685.%E5%86%97%E4%BD%99%E8%BF%9E%E6%8E%A5II.md
	https://github.com/hopeforcode/leetcode-master#模拟
657.机器人能否返回原点	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0657.%E6%9C%BA%E5%99%A8%E4%BA%BA%E8%83%BD%E5%90%A6%E8%BF%94%E5%9B%9E%E5%8E%9F%E7%82%B9.md
31.下一个排列	https://github.com/hopeforcode/leetcode-master/blob/master/problems/0031.%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%8E%92%E5%88%97.md
	https://github.com/hopeforcode/leetcode-master#位运算
1356.根据数字二进制下1的数目排序	https://github.com/hopeforcode/leetcode-master/blob/master/problems/1356.%E6%A0%B9%E6%8D%AE%E6%95%B0%E5%AD%97%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%8B1%E7%9A%84%E6%95%B0%E7%9B%AE%E6%8E%92%E5%BA%8F.md
	https://github.com/hopeforcode/leetcode-master#算法模板
各类基础算法模板	https://github.com/youngyangyang04/leetcode/blob/master/problems/%E7%AE%97%E6%B3%95%E6%A8%A1%E6%9D%BF.md
	https://github.com/hopeforcode/leetcode-master#b站算法视频讲解
B站「代码随想录」	https://space.bilibili.com/525438321
KMP算法（理论篇）	https://www.bilibili.com/video/BV1PD4y1o7nd
KMP算法（代码篇）	https://www.bilibili.com/video/BV1M5411j7Xx
回溯算法理论基础	https://www.bilibili.com/video/BV1cy4y167mM
回溯算法之组合问题（力扣题目：77.组合）	https://www.bilibili.com/video/BV1ti4y1L7cv
组合问题的剪枝操作（对应力扣题目：77.组合）	https://www.bilibili.com/video/BV1wi4y157er
组合总和（对应力扣题目：39.组合总和）	https://www.bilibili.com/video/BV1KT4y1M7HJ/
分割回文串（对应力扣题目：131.分割回文串)	https://www.bilibili.com/video/BV1c54y1e7k6
二叉树理论基础	https://www.bilibili.com/video/BV1Hy4y1t7ij
二叉树的递归遍历	https://www.bilibili.com/video/BV1Wh411S7xt
二叉树的非递归遍历（一）	https://www.bilibili.com/video/BV15f4y1W7i2
	https://github.com/hopeforcode/leetcode-master#贡献者
点此这里	https://github.com/youngyangyang04/leetcode-master/graphs/contributors
	https://github.com/hopeforcode/leetcode-master#关于作者
	https://camo.githubusercontent.com/f41ed6338d746e996ce5a536d79ed16e73f15eaa1369b6e364b792155ab24fef/68747470733a2f2f636f64652d7468696e6b696e672d313235333835353039332e66696c652e6d7971636c6f75642e636f6d2f706963732fe7acace4ba8ce4bc81e4b89ae588b7e9a298e6b4bbe7a0812e706e67
	https://github.com/hopeforcode/leetcode-master#公众号
	https://camo.githubusercontent.com/cdedbc69d7ce3af02121ab5fa29000df25d359969b20a46bf915108f8b571e8e/68747470733a2f2f636f64652d7468696e6b696e672d313235333835353039332e66696c652e6d7971636c6f75642e636f6d2f706963732f32303231313032363132323834312e706e67
Readme	https://github.com/hopeforcode/leetcode-master#readme-ov-file
Please reload this page	https://github.com/hopeforcode/leetcode-master
Activity	https://github.com/hopeforcode/leetcode-master/activity
0 forks	https://github.com/hopeforcode/leetcode-master/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fhopeforcode%2Fleetcode-master&report=hopeforcode+%28user%29
Releases	https://github.com/hopeforcode/leetcode-master/releases
Packages 0	https://github.com/users/hopeforcode/packages?repo_name=leetcode-master
Please reload this page	https://github.com/hopeforcode/leetcode-master
Contributors	https://github.com/hopeforcode/leetcode-master/graphs/contributors
Please reload this page	https://github.com/hopeforcode/leetcode-master
	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

Viewport: width=device-width

URLs of crawlers that visited me.