René's URL Explorer Experiment

Title: GitHub - helihui/leetcode: LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。) · GitHub

Open Graph Title: GitHub - helihui/leetcode: LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。)

X Title: GitHub - helihui/leetcode: LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。)

Description: LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。) - helihui/leetcode

Open Graph Description: LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。) - helihui/leetcode

X Description: LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。) - helihui/leetcode

Opengraph URL: https://github.com/helihui/leetcode

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:b7aa8cbf-11ae-b10b-99c5-875027c4da39
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	B736:1A5602:29158F:38E78B:6A57CAC7
html-safe-nonce	1fedda741a32db5df51c673ff114b2c9b5f1be496cfa9d241ec66c39aec815f4
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCNzM2OjFBNTYwMjoyOTE1OEY6MzhFNzhCOjZBNTdDQUM3IiwidmlzaXRvcl9pZCI6Ijc4Njk3MTMzNDQ2ODkwNjQ2NDciLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ==
visitor-hmac	902d1be34edf35ec3576018b227c970a3301f7a5c683d95a2e8a435208f3dd63
hovercard-subject-tag	repository:786559646
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/helihui/leetcode
twitter:image	https://opengraph.githubassets.com/0db2d252bed06b75a24b1ed69a78e41428b513ecffbd63ac5f22785749e03707/helihui/leetcode
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/0db2d252bed06b75a24b1ed69a78e41428b513ecffbd63ac5f22785749e03707/helihui/leetcode
og:image:alt	LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。) - helihui/leetcode
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	5bf9f84655de1d0e9aa064cd3b2bc9703556c68ae53b94e21b872b7e9f1f7cc1
turbo-cache-control	no-cache
go-import	github.com/helihui/leetcode git https://github.com/helihui/leetcode.git
octolytics-dimension-user_id	5126423
octolytics-dimension-user_login	helihui
octolytics-dimension-repository_id	786559646
octolytics-dimension-repository_nwo	helihui/leetcode
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	127407957
octolytics-dimension-repository_parent_nwo	azl397985856/leetcode
octolytics-dimension-repository_network_root_id	127407957
octolytics-dimension-repository_network_root_nwo	azl397985856/leetcode
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	f76ee5bea8be15c2aede06f855f5c4c808f6eaf5
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/helihui/leetcode#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fhelihui%2Fleetcode
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%2Fhelihui%2Fleetcode
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=helihui%2Fleetcode
Reload	https://github.com/helihui/leetcode
Reload	https://github.com/helihui/leetcode
Reload	https://github.com/helihui/leetcode
helihui	https://github.com/helihui
leetcode	https://github.com/helihui/leetcode
azl397985856/leetcode	https://github.com/azl397985856/leetcode
Notifications	https://github.com/login?return_to=%2Fhelihui%2Fleetcode
Fork 0	https://github.com/login?return_to=%2Fhelihui%2Fleetcode
Star 0	https://github.com/login?return_to=%2Fhelihui%2Fleetcode
Code	https://github.com/helihui/leetcode
Pull requests 0	https://github.com/helihui/leetcode/pulls
Actions	https://github.com/helihui/leetcode/actions
Projects	https://github.com/helihui/leetcode/projects
Security and quality 0	https://github.com/helihui/leetcode/security
Insights	https://github.com/helihui/leetcode/pulse
Code	https://github.com/helihui/leetcode
Pull requests	https://github.com/helihui/leetcode/pulls
Actions	https://github.com/helihui/leetcode/actions
Projects	https://github.com/helihui/leetcode/projects
Security and quality	https://github.com/helihui/leetcode/security
Insights	https://github.com/helihui/leetcode/pulse
	https://github.com/helihui/leetcode
Branches	https://github.com/helihui/leetcode/branches
Tags	https://github.com/helihui/leetcode/tags
	https://github.com/helihui/leetcode/branches
	https://github.com/helihui/leetcode/tags
1,787 Commits	https://github.com/helihui/leetcode/commits/master/
	https://github.com/helihui/leetcode/commits/master/
.github	https://github.com/helihui/leetcode/tree/master/.github
.github	https://github.com/helihui/leetcode/tree/master/.github
.vscode	https://github.com/helihui/leetcode/tree/master/.vscode
.vscode	https://github.com/helihui/leetcode/tree/master/.vscode
91	https://github.com/helihui/leetcode/tree/master/91
91	https://github.com/helihui/leetcode/tree/master/91
assets	https://github.com/helihui/leetcode/tree/master/assets
assets	https://github.com/helihui/leetcode/tree/master/assets
backlog	https://github.com/helihui/leetcode/tree/master/backlog
backlog	https://github.com/helihui/leetcode/tree/master/backlog
collections	https://github.com/helihui/leetcode/tree/master/collections
collections	https://github.com/helihui/leetcode/tree/master/collections
daily	https://github.com/helihui/leetcode/tree/master/daily
daily	https://github.com/helihui/leetcode/tree/master/daily
problems	https://github.com/helihui/leetcode/tree/master/problems
problems	https://github.com/helihui/leetcode/tree/master/problems
selected	https://github.com/helihui/leetcode/tree/master/selected
selected	https://github.com/helihui/leetcode/tree/master/selected
templates	https://github.com/helihui/leetcode/tree/master/templates
templates	https://github.com/helihui/leetcode/tree/master/templates
thinkings	https://github.com/helihui/leetcode/tree/master/thinkings
thinkings	https://github.com/helihui/leetcode/tree/master/thinkings
.gitignore	https://github.com/helihui/leetcode/blob/master/.gitignore
.gitignore	https://github.com/helihui/leetcode/blob/master/.gitignore
.mdl_style.rb	https://github.com/helihui/leetcode/blob/master/.mdl_style.rb
.mdl_style.rb	https://github.com/helihui/leetcode/blob/master/.mdl_style.rb
.mdlrc	https://github.com/helihui/leetcode/blob/master/.mdlrc
.mdlrc	https://github.com/helihui/leetcode/blob/master/.mdlrc
.nojekyll	https://github.com/helihui/leetcode/blob/master/.nojekyll
.nojekyll	https://github.com/helihui/leetcode/blob/master/.nojekyll
CONTRIBUTING.en.md	https://github.com/helihui/leetcode/blob/master/CONTRIBUTING.en.md
CONTRIBUTING.en.md	https://github.com/helihui/leetcode/blob/master/CONTRIBUTING.en.md
CONTRIBUTING.md	https://github.com/helihui/leetcode/blob/master/CONTRIBUTING.md
CONTRIBUTING.md	https://github.com/helihui/leetcode/blob/master/CONTRIBUTING.md
Kapture 2020-08-19 at 11.37.36.gif	https://github.com/helihui/leetcode/blob/master/Kapture%202020-08-19%20at%2011.37.36.gif
Kapture 2020-08-19 at 11.37.36.gif	https://github.com/helihui/leetcode/blob/master/Kapture%202020-08-19%20at%2011.37.36.gif
LICENSE.txt	https://github.com/helihui/leetcode/blob/master/LICENSE.txt
LICENSE.txt	https://github.com/helihui/leetcode/blob/master/LICENSE.txt
README.en.md	https://github.com/helihui/leetcode/blob/master/README.en.md
README.en.md	https://github.com/helihui/leetcode/blob/master/README.en.md
README.md	https://github.com/helihui/leetcode/blob/master/README.md
README.md	https://github.com/helihui/leetcode/blob/master/README.md
SUMMARY.md	https://github.com/helihui/leetcode/blob/master/SUMMARY.md
SUMMARY.md	https://github.com/helihui/leetcode/blob/master/SUMMARY.md
_config.yml	https://github.com/helihui/leetcode/blob/master/_config.yml
_config.yml	https://github.com/helihui/leetcode/blob/master/_config.yml
book.json	https://github.com/helihui/leetcode/blob/master/book.json
book.json	https://github.com/helihui/leetcode/blob/master/book.json
cover.jpg	https://github.com/helihui/leetcode/blob/master/cover.jpg
cover.jpg	https://github.com/helihui/leetcode/blob/master/cover.jpg
donation.md	https://github.com/helihui/leetcode/blob/master/donation.md
donation.md	https://github.com/helihui/leetcode/blob/master/donation.md
epilogue.md	https://github.com/helihui/leetcode/blob/master/epilogue.md
epilogue.md	https://github.com/helihui/leetcode/blob/master/epilogue.md
introduction.md	https://github.com/helihui/leetcode/blob/master/introduction.md
introduction.md	https://github.com/helihui/leetcode/blob/master/introduction.md
package.json	https://github.com/helihui/leetcode/blob/master/package.json
package.json	https://github.com/helihui/leetcode/blob/master/package.json
thanksGiving.md	https://github.com/helihui/leetcode/blob/master/thanksGiving.md
thanksGiving.md	https://github.com/helihui/leetcode/blob/master/thanksGiving.md
thanksGiving2.md	https://github.com/helihui/leetcode/blob/master/thanksGiving2.md
thanksGiving2.md	https://github.com/helihui/leetcode/blob/master/thanksGiving2.md
thanksGiving3.md	https://github.com/helihui/leetcode/blob/master/thanksGiving3.md
thanksGiving3.md	https://github.com/helihui/leetcode/blob/master/thanksGiving3.md
yarn.lock	https://github.com/helihui/leetcode/blob/master/yarn.lock
yarn.lock	https://github.com/helihui/leetcode/blob/master/yarn.lock
README	https://github.com/helihui/leetcode
Contributing	https://github.com/helihui/leetcode
License	https://github.com/helihui/leetcode
	https://github.com/helihui/leetcode#leetcode
	https://github.com/helihui/leetcode/blob/master
	https://github.com/helihui/leetcode/blob/master
	https://github.com/helihui/leetcode/blob/master
	https://github.com/helihui/leetcode/blob/master
	https://github.com/helihui/leetcode/blob/master
	https://github.com/helihui/leetcode/blob/master
	https://github.com/helihui/leetcode#%E5%93%AA%E9%87%8C%E8%83%BD%E6%89%BE%E5%88%B0%E6%88%91
	https://github.com/helihui/leetcode#%E5%93%AA%E9%87%8C%E8%83%BD%E6%89%BE%E5%88%B0%E6%88%91
	https://p.ipic.vip/pj4t8y.jpg
	https://p.ipic.vip/n9co7k.jpg
	https://p.ipic.vip/m7g3to.jpg
English	https://github.com/helihui/leetcode/blob/master/README.en.md
	https://github.com/helihui/leetcode#-我的算法通关之路出版了-
	https://camo.githubusercontent.com/a4b2dfc6dd2dd70ee109ee2815e101c56f0c1b56b92a825bda9cfd7fa64ac4ac/68747470733a2f2f702e697069632e7669702f7a6f38637a352e6a7067
实体版购书链接 1	https://union-click.jd.com/jdc?e=618%7Cpc%7C&p=JF8BAN4JK1olXwUFU1xcAUoRA18IGFMXXgQDUG4ZVxNJXF9RXh5UHw0cSgYYXBcIWDoXSQVJQwYBXFxeCkoTHDZNRwYlQ1J3BB0EWEl0QhkIH1xMBXBlDyQ1TkcbM244G1oUXQ4HU1tbDXsnA2g4STXN67Da8e9B3OGY1uefK1olXQEEUFhYCkgSAWwOHmsSXQ8yDwszD0sSUDtbGAlCDVJVAW5tOEgnBG8BD11nHFQWUixtOEsnAF9KdV5AWQcDB1cPDktEAWpfSwhFXwUDUllVDkMVATxbHVwWbQQDVVpUOHs
实体版购书链接 2	https://union-click.jd.com/jdc?e=618%7Cpc%7C&p=JF8BAM0JK1olXDYCV1ZfC0kWB19MRANLAjZbERscSkAJHTdNTwcKBlMdBgABFksUC20LGVoRQl9HCANtQDt-RAZPBQFwJ0ZEA1hDWh9wdTB2a1cZbQcyVF9cCEMSBGoOHmslXQEyAjBdCUoWAm4NG14WbQcyVFlYDk4eBG8LG1gUXzYFVFdtUx55BG8NSA9GXlRVBAoKXXsnM2w4HFscEEdQGW5tCHsUMy1mE14WDQcCUVxfWk9EBmkOSQsWDwVSVwpcWEoXUG5aElslXwcDUFdt
电子版购书链接	https://union-click.jd.com/jdc?e=&p=JF8BAL0JK1olXDYAVVhfD04UAl9MRANLAjZbERscSkAJHTdNTwcKBlMdBgABFkkWBW0PHlgUQl9HCANtcS0SdTFvWVt1X3BkVV4Kc0JxYRtPe1cZbQcyVF9cCEMSBGoOHmslXQEyHzBcOEonA2gKE1oVWwEKXV5cAXsQA2Y4QA57WgYHBwoOCxlAUztfTmslbQUyZG5dOEgnQQFaSQ5FWQYFB1cODhgSVDpaS1hFDwQLUlwJAU5DAWcJHWsXXAcGXW4
	https://github.com/helihui/leetcode#blue_book-电子书
在线阅读地址	https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/
	https://camo.githubusercontent.com/435b8521947670bd104ff973339c76d6b647d7c185efc9657b3f5cc6ca4ac13e/68747470733a2f2f702e697069632e7669702f68396e6d37372e6a7067
	https://github.com/helihui/leetcode#图片加载不出来如何解决
https://github.com/fe-lucifer/fanqiang	https://github.com/fe-lucifer/fanqiang
	https://github.com/helihui/leetcode#力扣专属折扣
	https://camo.githubusercontent.com/467dc61bb6d9d0d3b4562243fe34aec5383f3312c95fb4e83d5c464a171b11fe/68747470733a2f2f702e697069632e7669702f6861313334702e706e67
https://leetcode.cn/premium/?promoChannel=lucifer	https://leetcode.cn/premium/?promoChannel=lucifer
	https://github.com/helihui/leetcode#calendar91-天学算法限时活动
点此参与	https://github.com/azl397985856/leetcode/discussions/532
活动首页	https://leetcode-solution.cn/91
91 第三期讲义 - 二分专题（上）	https://github.com/helihui/leetcode/blob/master/thinkings/binary-search-1.md
91 第三期讲义 - 二分专题（下）	https://github.com/helihui/leetcode/blob/master/thinkings/binary-search-2.md
	https://github.com/helihui/leetcode#1v1-辅导
	https://github.com/helihui/leetcode#octocat-仓库介绍
	https://github.com/helihui/leetcode#meat_on_bone-仓库食用指南
	https://camo.githubusercontent.com/362e146541cab7535bb6751b99a32a6f612affac7006ad8a4bd90128f3cf9a68/68747470733a2f2f702e697069632e7669702f6132306f33782e6a7067
《Interview Cheat Sheet》	https://github.com/helihui/leetcode/blob/master/assets/cheatsheet.pdf
	https://github.com/helihui/leetcode#数据结构与算法的总结
数据结构总览	https://github.com/helihui/leetcode/blob/master/thinkings/basic-data-structure.md
链表专题	https://github.com/helihui/leetcode/blob/master/thinkings/linked-list.md
树专题	https://github.com/helihui/leetcode/blob/master/thinkings/tree.md
堆专题（上）	https://github.com/helihui/leetcode/blob/master/thinkings/heap.md
堆专题（下）	https://github.com/helihui/leetcode/blob/master/thinkings/heap-2.md
二分专题（上）	https://github.com/helihui/leetcode/blob/master/thinkings/binary-search-1.md
二分专题（下）	https://github.com/helihui/leetcode/blob/master/thinkings/binary-search-2.md
动态规划（重置版）	https://github.com/helihui/leetcode/blob/master/thinkings/dynamic-programming.md
大话搜索	https://github.com/helihui/leetcode/blob/master/thinkings/search.md
二叉树的遍历	https://github.com/helihui/leetcode/blob/master/thinkings/binary-tree-traversal.md
回溯	https://github.com/helihui/leetcode/blob/master/thinkings/backtrack.md
哈夫曼编码和游程编码	https://github.com/helihui/leetcode/blob/master/thinkings/run-length-encode-and-huffman-encode.md
布隆过滤器	https://github.com/helihui/leetcode/blob/master/thinkings/bloom-filter.md
前缀树	https://github.com/helihui/leetcode/blob/master/thinkings/trie.md
《日程安排》专题	https://lucifer.ren/blog/2020/02/03/leetcode-%E6%88%91%E7%9A%84%E6%97%A5%E7%A8%8B%E5%AE%89%E6%8E%92%E8%A1%A8%E7%B3%BB%E5%88%97/
《构造二叉树》专题	https://lucifer.ren/blog/2020/02/08/%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%93%E9%A2%98/
滑动窗口（思路 + 模板）	https://github.com/helihui/leetcode/blob/master/thinkings/slide-window.md
位运算	https://github.com/helihui/leetcode/blob/master/thinkings/bit.md
小岛问题	https://github.com/helihui/leetcode/blob/master/thinkings/island.md
最大公约数	https://github.com/helihui/leetcode/blob/master/thinkings/GCD.md
并查集	https://github.com/helihui/leetcode/blob/master/thinkings/union-find.md
平衡二叉树专题	https://github.com/helihui/leetcode/blob/master/thinkings/balanced-tree.md
蓄水池抽样	https://github.com/helihui/leetcode/blob/master/thinkings/reservoid-sampling.md
单调栈	https://github.com/helihui/leetcode/blob/master/thinkings/monotone-stack.md
	https://github.com/helihui/leetcode#exclamation-怎么刷-leetcode
我是如何刷 LeetCode 的	https://www.zhihu.com/question/280279208/answer/824585814
算法小白如何高效、快速刷 leetcode？	https://www.zhihu.com/question/321738058/answer/1279464192
刷题效率低？或许你就差这么一个插件	https://lucifer.ren/blog/2020/06/06/algo-chrome-extension/
力扣刷题插件	https://lucifer.ren/blog/2020/08/16/leetcode-cheat/
	https://github.com/helihui/leetcode#computer-插件
https://chrome.google.com/webstore/detail/leetcode-cheatsheet/fniccleejlofifaakbgppmbbcdfjonle?hl=en-US	https://chrome.google.com/webstore/detail/leetcode-cheatsheet/fniccleejlofifaakbgppmbbcdfjonle?hl=en-US
https://zerotrac.github.io/leetcode_problem_rating/	https://zerotrac.github.io/leetcode_problem_rating/
	https://github.com/helihui/leetcode#精选题解
字典序列删除	https://github.com/helihui/leetcode/blob/master/selected/a-deleted.md
一次搞定前缀和	https://github.com/helihui/leetcode/blob/master/selected/atMostK.md
字节跳动的算法面试题是什么难度？	https://github.com/helihui/leetcode/blob/master/selected/byte-dance-algo-ex.md
字节跳动的算法面试题是什么难度？（第二弹）	https://github.com/helihui/leetcode/blob/master/selected/byte-dance-algo-ex-2017.md
《我是你的妈妈呀》 - 第一期	https://github.com/helihui/leetcode/blob/master/selected/mother-01.md
一文带你看懂二叉树的序列化	https://github.com/helihui/leetcode/blob/master/selected/serialize.md
穿上衣服我就不认识你了？来聊聊最长上升子序列	https://github.com/helihui/leetcode/blob/master/selected/LIS.md
你的衣服我扒了 - 《最长公共子序列》	https://github.com/helihui/leetcode/blob/master/selected/LCS.md
一文看懂《最大子序列和问题》	https://github.com/helihui/leetcode/blob/master/selected/LSS.md
	https://github.com/helihui/leetcode#leetcode-经典题目的解析200-多道
	https://github.com/helihui/leetcode#简单难度题目合集
面试题 17.12. BiNode	https://github.com/helihui/leetcode/blob/master/problems/binode-lcci.md
0001. 两数之和	https://github.com/helihui/leetcode/blob/master/problems/1.two-sum.md
0020. 有效的括号	https://github.com/helihui/leetcode/blob/master/problems/20.valid-parentheses.md
0021. 合并两个有序链表	https://github.com/helihui/leetcode/blob/master/problems/21.merge-two-sorted-lists.md
0026. 删除排序数组中的重复项	https://github.com/helihui/leetcode/blob/master/problems/26.remove-duplicates-from-sorted-array.md
0053. 最大子序和	https://github.com/helihui/leetcode/blob/master/problems/53.maximum-sum-subarray-cn.md
0066. 加一	https://github.com/helihui/leetcode/blob/master/problems/66.plus-one.md
0088. 合并两个有序数组	https://github.com/helihui/leetcode/blob/master/problems/88.merge-sorted-array.md
0101. 对称二叉树	https://github.com/helihui/leetcode/blob/master/problems/101.symmetric-tree.md
0104. 二叉树的最大深度	https://github.com/helihui/leetcode/blob/master/problems/104.maximum-depth-of-binary-tree.md
0108. 将有序数组转换为二叉搜索树	https://github.com/helihui/leetcode/blob/master/problems/108.convert-sorted-array-to-binary-search-tree.md
0121. 买卖股票的最佳时机	https://github.com/helihui/leetcode/blob/master/problems/121.best-time-to-buy-and-sell-stock.md
0122. 买卖股票的最佳时机 II	https://github.com/helihui/leetcode/blob/master/problems/122.best-time-to-buy-and-sell-stock-ii.md
0125. 验证回文串	https://github.com/helihui/leetcode/blob/master/problems/125.valid-palindrome.md
0136. 只出现一次的数字	https://github.com/helihui/leetcode/blob/master/problems/136.single-number.md
0155. 最小栈	https://github.com/helihui/leetcode/blob/master/problems/155.min-stack.md
0160. 相交链表	https://github.com/helihui/leetcode/blob/master/problems/160.Intersection-of-Two-Linked-Lists.md
0167. 两数之和 II 输入有序数组	https://github.com/helihui/leetcode/blob/master/problems/167.two-sum-ii-input-array-is-sorted.md
0169. 多数元素	https://github.com/helihui/leetcode/blob/master/problems/169.majority-element.md
0172. 阶乘后的零	https://github.com/helihui/leetcode/blob/master/problems/172.factorial-trailing-zeroes.md
0190. 颠倒二进制位	https://github.com/helihui/leetcode/blob/master/problems/190.reverse-bits.md
0191. 位 1 的个数	https://github.com/helihui/leetcode/blob/master/problems/191.number-of-1-bits.md
0198. 打家劫舍	https://github.com/helihui/leetcode/blob/master/problems/198.house-robber.md
0203. 移除链表元素	https://github.com/helihui/leetcode/blob/master/problems/203.remove-linked-list-elements.md
0206. 反转链表	https://github.com/helihui/leetcode/blob/master/problems/206.reverse-linked-list.md
0219. 存在重复元素 II	https://github.com/helihui/leetcode/blob/master/problems/219.contains-duplicate-ii.md
0226. 翻转二叉树	https://github.com/helihui/leetcode/blob/master/problems/226.invert-binary-tree.md
0232. 用栈实现队列	https://github.com/helihui/leetcode/blob/master/problems/232.implement-queue-using-stacks.md
0263. 丑数	https://github.com/helihui/leetcode/blob/master/problems/263.ugly-number.md
0283. 移动零	https://github.com/helihui/leetcode/blob/master/problems/283.move-zeroes.md
0342. 4 的幂	https://github.com/helihui/leetcode/blob/master/problems/342.power-of-four.md
0349. 两个数组的交集	https://github.com/helihui/leetcode/blob/master/problems/349.intersection-of-two-arrays.md
0371. 两整数之和	https://github.com/helihui/leetcode/blob/master/problems/371.sum-of-two-integers.md
401. 二进制手表	https://github.com/helihui/leetcode/blob/master/problems/401.binary-watch.md
0437. 路径总和 III	https://github.com/helihui/leetcode/blob/master/problems/437.path-sum-iii.md
0455. 分发饼干	https://github.com/helihui/leetcode/blob/master/problems/455.AssignCookies.md
0504. 七进制数	https://github.com/helihui/leetcode/blob/master/problems/504.base-7.md
0575. 分糖果	https://github.com/helihui/leetcode/blob/master/problems/575.distribute-candies.md
0606. 根据二叉树创建字符串	https://github.com/helihui/leetcode/blob/master/problems/606.construct-string-from-binary-tree.md
0661. 图片平滑器	https://github.com/helihui/leetcode/blob/master/problems/661.image-smoother.md
0665. 非递减数列	https://github.com/helihui/leetcode/blob/master/problems/665.non-decreasing-array.md
821. 字符的最短距离	https://github.com/helihui/leetcode/blob/master/problems/821.shortest-distance-to-a-character.md
0874. 模拟行走机器人	https://github.com/helihui/leetcode/blob/master/problems/874.walking-robot-simulation.md
1128. 等价多米诺骨牌对的数量	https://github.com/helihui/leetcode/blob/master/problems/1128.number-of-equivalent-domino-pairs.md
1260. 二维网格迁移	https://github.com/helihui/leetcode/blob/master/problems/1260.shift-2d-grid.md
1332. 删除回文子序列	https://github.com/helihui/leetcode/blob/master/problems/1332.remove-palindromic-subsequences.md
2591. 将钱分给最多的儿童	https://github.com/helihui/leetcode/blob/master/problems/2591.distribute-money-to-maximum-children.md
	https://github.com/helihui/leetcode#中等难度题目合集
面试题 17.09. 第 k 个数	https://github.com/helihui/leetcode/blob/master/problems/get-kth-magic-number-lcci.md
面试题 17.23. 最大黑方阵	https://github.com/helihui/leetcode/blob/master/problems/max-black-square-lcci.md
面试题 16.16. 部分排序	https://github.com/helihui/leetcode/blob/master/problems/sub-sort-lcci.md
Increasing Digits	https://github.com/helihui/leetcode/blob/master/problems/Increasing-Digits.md
Longest Contiguously Strictly Increasing Sublist After Deletion	https://github.com/helihui/leetcode/blob/master/problems/Longest-Contiguously-Strictly-Increasing-Sublist-After-Deletion.md
Consecutive Wins	https://github.com/helihui/leetcode/blob/master/problems/consecutive-wins.md
Sort-String-by-Flipping	https://github.com/helihui/leetcode/blob/master/problems/Sort-String-by-Flipping.md
Number of Substrings with Single Character Difference	https://github.com/helihui/leetcode/blob/master/problems/Number-of-Substrings-with-Single-Character-Difference.md
Bus Fare	https://github.com/helihui/leetcode/blob/master/problems/Bus-Fare.md
Minimum Dropping Path Sum	https://github.com/helihui/leetcode/blob/master/problems/Minimum-Dropping-Path-Sum.md
Longest-Matrix-Path-Length	https://github.com/helihui/leetcode/blob/master/problems/Longest-Matrix-Path-Length.md
Every Sublist Min Sum	https://github.com/helihui/leetcode/blob/master/problems/Every-Sublist-Min-Sum.md
Maximize the Number of Equivalent Pairs After Swaps	https://github.com/helihui/leetcode/blob/master/problems/Maximize-the-Number-of-Equivalent-Pairs-After-Swaps.md
0002. 两数相加	https://github.com/helihui/leetcode/blob/master/problems/2.add-two-numbers.md
0003. 无重复字符的最长子串	https://github.com/helihui/leetcode/blob/master/problems/3.longest-substring-without-repeating-characters.md
0005. 最长回文子串	https://github.com/helihui/leetcode/blob/master/problems/5.longest-palindromic-substring.md
0011. 盛最多水的容器	https://github.com/helihui/leetcode/blob/master/problems/11.container-with-most-water.md
0015. 三数之和	https://github.com/helihui/leetcode/blob/master/problems/15.3sum.md
0017. 电话号码的字母组合	https://github.com/helihui/leetcode/blob/master/problems/17.Letter-Combinations-of-a-Phone-Number.md
0019. 删除链表的倒数第 N 个节点	https://github.com/helihui/leetcode/blob/master/problems/19.removeNthNodeFromEndofList.md
0022. 括号生成	https://github.com/helihui/leetcode/blob/master/problems/22.generate-parentheses.md
0024. 两两交换链表中的节点	https://github.com/helihui/leetcode/blob/master/problems/24.swapNodesInPairs.md
0029. 两数相除	https://github.com/helihui/leetcode/blob/master/problems/29.divide-two-integers.md
0031. 下一个排列	https://github.com/helihui/leetcode/blob/master/problems/31.next-permutation.md
0033. 搜索旋转排序数组	https://github.com/helihui/leetcode/blob/master/problems/33.search-in-rotated-sorted-array.md
0039. 组合总和	https://github.com/helihui/leetcode/blob/master/problems/39.combination-sum.md
0040. 组合总和 II	https://github.com/helihui/leetcode/blob/master/problems/40.combination-sum-ii.md
0046. 全排列	https://github.com/helihui/leetcode/blob/master/problems/46.permutations.md
0047. 全排列 II	https://github.com/helihui/leetcode/blob/master/problems/47.permutations-ii.md
0048. 旋转图像	https://github.com/helihui/leetcode/blob/master/problems/48.rotate-image.md
0049. 字母异位词分组	https://github.com/helihui/leetcode/blob/master/problems/49.group-anagrams.md
0050. Pow(x, n)	https://github.com/helihui/leetcode/blob/master/problems/50.pow-x-n.md
0055. 跳跃游戏	https://github.com/helihui/leetcode/blob/master/problems/55.jump-game.md
0056. 合并区间	https://github.com/helihui/leetcode/blob/master/problems/56.merge-intervals.md
0060. 第 k 个排列	https://github.com/helihui/leetcode/blob/master/problems/60.permutation-sequence.md
0061. 旋转链表	https://github.com/helihui/leetcode/blob/master/problems/61.Rotate-List.md
0062. 不同路径	https://github.com/helihui/leetcode/blob/master/problems/62.unique-paths.md
0073. 矩阵置零	https://github.com/helihui/leetcode/blob/master/problems/73.set-matrix-zeroes.md
0075. 颜色分类	https://github.com/helihui/leetcode/blob/master/problems/75.sort-colors.md
0078. 子集	https://github.com/helihui/leetcode/blob/master/problems/78.subsets.md
0079. 单词搜索	https://github.com/helihui/leetcode/blob/master/problems/79.word-search.md
0080. 删除排序数组中的重复项 II	https://github.com/helihui/leetcode/blob/master/problems/80.remove-duplicates-from-sorted-array-ii.md
0086. 分隔链表	https://github.com/helihui/leetcode/blob/master/problems/86.partition-list.md
0090. 子集 II	https://github.com/helihui/leetcode/blob/master/problems/90.subsets-ii.md
0091. 解码方法	https://github.com/helihui/leetcode/blob/master/problems/91.decode-ways.md
0092. 反转链表 II	https://github.com/helihui/leetcode/blob/master/problems/92.reverse-linked-list-ii.md
0094. 二叉树的中序遍历	https://github.com/helihui/leetcode/blob/master/problems/94.binary-tree-inorder-traversal.md
0095. 不同的二叉搜索树 II	https://github.com/helihui/leetcode/blob/master/problems/95.unique-binary-search-trees-ii.md
0096. 不同的二叉搜索树	https://github.com/helihui/leetcode/blob/master/problems/96.unique-binary-search-trees.md
0098. 验证二叉搜索树	https://github.com/helihui/leetcode/blob/master/problems/98.validate-binary-search-tree.md
0102. 二叉树的层序遍历	https://github.com/helihui/leetcode/blob/master/problems/102.binary-tree-level-order-traversal.md
0103. 二叉树的锯齿形层次遍历	https://github.com/helihui/leetcode/blob/master/problems/103.binary-tree-zigzag-level-order-traversal.md
0113. 路径总和 II	https://github.com/helihui/leetcode/blob/master/problems/113.path-sum-ii.md
0129. 求根到叶子节点数字之和	https://github.com/helihui/leetcode/blob/master/problems/129.sum-root-to-leaf-numbers.md
0130. 被围绕的区域	https://github.com/helihui/leetcode/blob/master/problems/130.surrounded-regions.md
0131. 分割回文串	https://github.com/helihui/leetcode/blob/master/problems/131.palindrome-partitioning.md
0139. 单词拆分	https://github.com/helihui/leetcode/blob/master/problems/139.word-break.md
0144. 二叉树的前序遍历	https://github.com/helihui/leetcode/blob/master/problems/144.binary-tree-preorder-traversal.md
0147. 对链表进行插入排序	https://github.com/helihui/leetcode/blob/master/problems/147.insertion-sort-list.md
0150. 逆波兰表达式求值	https://github.com/helihui/leetcode/blob/master/problems/150.evaluate-reverse-polish-notation.md
0152. 乘积最大子数组	https://github.com/helihui/leetcode/blob/master/problems/152.maximum-product-subarray.md
0153. 寻找旋转排序数组中的最小值	https://github.com/helihui/leetcode/blob/master/problems/153.find-minimum-in-rotated-sorted-array.md
0199. 二叉树的右视图	https://github.com/helihui/leetcode/blob/master/problems/199.binary-tree-right-side-view.md
0200. 岛屿数量	https://github.com/helihui/leetcode/blob/master/problems/200.number-of-islands.md
0201. 数字范围按位与	https://github.com/helihui/leetcode/blob/master/problems/201.bitwise-and-of-numbers-range.md
0208. 实现 Trie （前缀树）	https://github.com/helihui/leetcode/blob/master/problems/208.implement-trie-prefix-tree.md
0209. 长度最小的子数组	https://github.com/helihui/leetcode/blob/master/problems/209.minimum-size-subarray-sum.md
0211. 添加与搜索单词 - 数据结构设计	https://github.com/helihui/leetcode/blob/master/problems/211.add-and-search-word-data-structure-design.md
0215. 数组中的第 K 个最大元素	https://github.com/helihui/leetcode/blob/master/problems/215.kth-largest-element-in-an-array.md
0220. 存在重复元素 III	https://github.com/helihui/leetcode/blob/master/problems/220.contains-duplicate-iii.md
0221. 最大正方形	https://github.com/helihui/leetcode/blob/master/problems/221.maximal-square.md
0227. 基本计算器 II	https://github.com/helihui/leetcode/blob/master/problems/227.basic-calculator-ii.md
0229. 求众数 II	https://github.com/helihui/leetcode/blob/master/problems/229.majority-element-ii.md
0230. 二叉搜索树中第 K 小的元素	https://github.com/helihui/leetcode/blob/master/problems/230.kth-smallest-element-in-a-bst.md
0236. 二叉树的最近公共祖先	https://github.com/helihui/leetcode/blob/master/problems/236.lowest-common-ancestor-of-a-binary-tree.md
0238. 除自身以外数组的乘积	https://github.com/helihui/leetcode/blob/master/problems/238.product-of-array-except-self.md
0240. 搜索二维矩阵 II	https://github.com/helihui/leetcode/blob/master/problems/240.search-a-2-d-matrix-ii.md
0279. 完全平方数	https://github.com/helihui/leetcode/blob/master/problems/279.perfect-squares.md
0309. 最佳买卖股票时机含冷冻期	https://github.com/helihui/leetcode/blob/master/problems/309.best-time-to-buy-and-sell-stock-with-cooldown.md
0322. 零钱兑换	https://github.com/helihui/leetcode/blob/master/problems/322.coin-change.md
0324. 摆动排序 II	https://github.com/helihui/leetcode/blob/master/problems/324.wiggle-sort-ii.md
0328. 奇偶链表	https://github.com/helihui/leetcode/blob/master/problems/328.odd-even-linked-list.md
0331. 验证二叉树的前序序列化	https://github.com/helihui/leetcode/blob/master/problems/331.verify-preorder-serialization-of-a-binary-tree.md
0334. 递增的三元子序列	https://github.com/helihui/leetcode/blob/master/problems/334.increasing-triplet-subsequence.md
0337. 打家劫舍 III	https://github.com/helihui/leetcode/blob/master/problems/337.house-robber-iii.md
0343. 整数拆分	https://github.com/helihui/leetcode/blob/master/problems/343.integer-break.md
0365. 水壶问题	https://github.com/helihui/leetcode/blob/master/problems/365.water-and-jug-problem.md
0378. 有序矩阵中第 K 小的元素	https://github.com/helihui/leetcode/blob/master/problems/378.kth-smallest-element-in-a-sorted-matrix.md
0380. 常数时间插入、删除和获取随机元素	https://github.com/helihui/leetcode/blob/master/problems/380.insert-delete-getrandom-o1.md
0385. 迷你语法分析器	https://github.com/helihui/leetcode/blob/master/problems/385.mini-parser.md
0394. 字符串解码	https://github.com/helihui/leetcode/blob/master/problems/394.decode-string.md
0416. 分割等和子集	https://github.com/helihui/leetcode/blob/master/problems/416.partition-equal-subset-sum.md
0424. 替换后的最长重复字符	https://github.com/helihui/leetcode/blob/master/problems/424.longest-repeating-character-replacement.md
0438. 找到字符串中所有字母异位词	https://github.com/helihui/leetcode/blob/master/problems/438.find-all-anagrams-in-a-string.md
0445. 两数相加 II	https://github.com/helihui/leetcode/blob/master/problems/445.add-two-numbers-ii.md
0454. 四数相加 II	https://github.com/helihui/leetcode/blob/master/problems/454.4-sum-ii.md
0456. 132 模式	https://github.com/helihui/leetcode/blob/master/problems/456.132-pattern.md
0457.457. 环形数组是否存在循环	https://github.com/helihui/leetcode/blob/master/problems/457.circular-array-loop.md
0464. 我能赢么	https://github.com/helihui/leetcode/blob/master/problems/464.can-i-win.md
0470. 用 Rand7() 实现 Rand10	https://github.com/helihui/leetcode/blob/master/problems/470.implement-rand10-using-rand7.md
0473. 火柴拼正方形	https://github.com/helihui/leetcode/blob/master/problems/473.matchsticks-to-square.md
0494. 目标和	https://github.com/helihui/leetcode/blob/master/problems/494.target-sum.md
0516. 最长回文子序列	https://github.com/helihui/leetcode/blob/master/problems/516.longest-palindromic-subsequence.md
0513. 找树左下角的值	https://github.com/helihui/leetcode/blob/master/problems/513.find-bottom-left-tree-value.md
0518. 零钱兑换 II	https://github.com/helihui/leetcode/blob/master/problems/518.coin-change-2.md
0525. 连续数组	https://github.com/helihui/leetcode/blob/master/problems/525.contiguous-array.md
0547. 省份数量	https://github.com/helihui/leetcode/blob/master/problems/547.number-of-provinces.md
0560. 和为 K 的子数组	https://github.com/helihui/leetcode/blob/master/problems/560.subarray-sum-equals-k.md
0609. 在系统中查找重复文件	https://github.com/helihui/leetcode/blob/master/problems/609.find-duplicate-file-in-system.md
0611. 有效三角形的个数	https://github.com/helihui/leetcode/blob/master/problems/611.valid-triangle-number.md
0673. 最长递增子序列的个数	https://github.com/helihui/leetcode/blob/master/problems/673.number-of-longest-increasing-subsequence.md
0686. 重复叠加字符串匹配	https://github.com/helihui/leetcode/blob/master/problems/686.repeated-string-match.md
0710. 黑名单中的随机数	https://github.com/helihui/leetcode/blob/master/problems/710.random-pick-with-blacklist.md
0714. 买卖股票的最佳时机含手续费	https://github.com/helihui/leetcode/blob/master/problems/714.best-time-to-buy-and-sell-stock-with-transaction-fee.md
0718. 最长重复子数组	https://github.com/helihui/leetcode/blob/master/problems/718.maximum-length-of-repeated-subarray.md
0735. 行星碰撞	https://github.com/helihui/leetcode/blob/master/problems/735.asteroid-collision.md
0754. 到达终点数字	https://github.com/helihui/leetcode/blob/master/problems/754.reach-a-number.md
0785. 判断二分图	https://github.com/helihui/leetcode/blob/master/problems/785.is-graph-bipartite.md
0790. 多米诺和托米诺平铺	https://github.com/helihui/leetcode/blob/master/problems/790.domino-and-tromino-tiling.md
0799. 香槟塔	https://github.com/helihui/leetcode/blob/master/problems/799.champagne-tower.md
0801. 使序列递增的最小交换次数	https://github.com/helihui/leetcode/blob/master/problems/801.minimum-swaps-to-make-sequences-increasing.md
0816. 模糊坐标	https://github.com/helihui/leetcode/blob/master/problems/816.ambiguous-coordinates.md
0820. 单词的压缩编码	https://github.com/helihui/leetcode/blob/master/problems/820.short-encoding-of-words.md
0838. 推多米诺	https://github.com/helihui/leetcode/blob/master/problems/838.push-dominoes.md
0873. 最长的斐波那契子序列的长度	https://github.com/helihui/leetcode/blob/master/problems/873.length-of-longest-fibonacci-subsequence.md
0875. 爱吃香蕉的珂珂	https://github.com/helihui/leetcode/blob/master/problems/875.koko-eating-bananas.md
0877. 石子游戏	https://github.com/helihui/leetcode/blob/master/problems/877.stone-game.md
0886. 可能的二分法	https://github.com/helihui/leetcode/blob/master/problems/886.possible-bipartition.md
0898. 子数组按位或操作	https://github.com/helihui/leetcode/blob/master/problems/898.bitwise-ors-of-subarrays.md
0900. RLE 迭代器	https://github.com/helihui/leetcode/blob/master/problems/900.rle-iterator.md
0911. 在线选举	https://github.com/helihui/leetcode/blob/master/problems/911.online-election.md
0912. 排序数组	https://github.com/helihui/leetcode/blob/master/problems/912.sort-an-array.md
0918. 环形子数组的最大和	https://github.com/helihui/leetcode/blob/master/problems/918.maximum-sum-circular-subarray.md
0932. 漂亮数组	https://github.com/helihui/leetcode/blob/master/problems/932.beautiful-array.md
0935. 骑士拨号器	https://github.com/helihui/leetcode/blob/master/problems/935.knight-dialer.md
0947. 移除最多的同行或同列石头	https://github.com/helihui/leetcode/blob/master/problems/947.most-stones-removed-with-same-row-or-column.md
0959. 由斜杠划分区域	https://github.com/helihui/leetcode/blob/master/problems/959.regions-cut-by-slashes.md
0978. 最长湍流子数组	https://github.com/helihui/leetcode/blob/master/problems/978.longest-turbulent-subarray.md
0987. 二叉树的垂序遍历	https://github.com/helihui/leetcode/blob/master/problems/987.vertical-order-traversal-of-a-binary-tree.md
1004. 最大连续 1 的个数 III	https://github.com/helihui/leetcode/blob/master/problems/1004.max-consecutive-ones-iii.md
1011. 在 D 天内送达包裹的能力	https://github.com/helihui/leetcode/blob/master/problems/1011.capacity-to-ship-packages-within-d-days.md
1014. 最佳观光组合	https://github.com/helihui/leetcode/blob/master/problems/1014.best-sightseeing-pair.md
1015. 可被 K 整除的最小整数	https://github.com/helihui/leetcode/blob/master/problems/1015.smallest-integer-divisible-by-k.md
1019. 链表中的下一个更大节点	https://github.com/helihui/leetcode/blob/master/problems/1019.next-greater-node-in-linked-list.md
1020. 飞地的数量	https://github.com/helihui/leetcode/blob/master/problems/1020.number-of-enclaves.md
1023. 驼峰式匹配	https://github.com/helihui/leetcode/blob/master/problems/1023.camelcase-matching.md
1031. 两个非重叠子数组的最大和	https://github.com/helihui/leetcode/blob/master/problems/1031.maximum-sum-of-two-non-overlapping-subarrays.md
1043. 分隔数组以得到最大和	https://github.com/helihui/leetcode/blob/master/problems/1043.partition-array-for-maximum-sum.md
1053. 交换一次的先前排列)	https://github.com/helihui/leetcode/blob/master/problems/1053.previous-permutation-with-one-swap.md
1104. 二叉树寻路	https://github.com/helihui/leetcode/blob/master/problems/1104.path-in-zigzag-labelled-binary-tree.md
1129. 颜色交替的最短路径	https://github.com/helihui/leetcode/blob/master/problems/1129.shortest-path-with-alternating-colors.md
1131. 绝对值表达式的最大值	https://github.com/helihui/leetcode/blob/master/problems/1131.maximum-of-absolute-value-expression.md
1138. 字母板上的路径	https://github.com/helihui/leetcode/blob/master/problems/1138.alphabet-board-path.md
1186. 删除一次得到子数组最大和	https://github.com/helihui/leetcode/blob/master/problems/1186.maximum-subarray-sum-with-one-deletion.md
1218. 最长定差子序列	https://github.com/helihui/leetcode/blob/master/problems/1218.longest-arithmetic-subsequence-of-given-difference.md
1227. 飞机座位分配概率	https://github.com/helihui/leetcode/blob/master/problems/1227.airplane-seat-assignment-probability.md
1261. 在受污染的二叉树中查找元素	https://github.com/helihui/leetcode/blob/master/problems/1261.find-elements-in-a-contaminated-binary-tree.md
1262. 可被三整除的最大和	https://github.com/helihui/leetcode/blob/master/problems/1262.greatest-sum-divisible-by-three.md
1297. 子串的最大出现次数	https://github.com/helihui/leetcode/blob/master/problems/1297.maximum-number-of-occurrences-of-a-substring.md
1310. 子数组异或查询	https://github.com/helihui/leetcode/blob/master/problems/1310.xor-queries-of-a-subarray.md
1334. 阈值距离内邻居最少的城市	https://github.com/helihui/leetcode/blob/master/problems/1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md
1371. 每个元音包含偶数次的最长子字符串	https://github.com/helihui/leetcode/blob/master/problems/1371.find-the-longest-substring-containing-vowels-in-even-counts.md
1381. 设计一个支持增量操作的栈	https://github.com/helihui/leetcode/blob/master/problems/1381.design-a-stack-with-increment-operation.md
1423. 可获得的最大点数	https://github.com/helihui/leetcode/blob/master/problems/1423.maximum-points-you-can-obtain-from-cards.md
1438. 绝对差不超过限制的最长连续子数组	https://github.com/helihui/leetcode/blob/master/problems/1438.longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md
1558. 得到目标数组的最少函数调用次数	https://github.com/helihui/leetcode/blob/master/problems/1558.minimum-numbers-of-function-calls-to-make-target-array.md
1574. 删除最短的子数组使剩余数组有序	https://github.com/helihui/leetcode/blob/master/problems/1574.shortest-subarray-to-be-removed-to-make-array-sorted.md
1589. 所有排列中的最大和	https://github.com/helihui/leetcode/blob/master/problems/1589.maximum-sum-obtained-of-any-permutation.md
1631. 最小体力消耗路径	https://github.com/helihui/leetcode/blob/master/problems/1631.path-with-minimum-effort.md
1638. 统计只差一个字符的子串数目	https://github.com/helihui/leetcode/blob/master/problems/1638.count-substrings-that-differ-by-one-character.md
1658. 将 x 减到 0 的最小操作数	https://github.com/helihui/leetcode/blob/master/problems/1658.minimum-operations-to-reduce-x-to-zero.md
1697. 检查边长度限制的路径是否存在	https://github.com/helihui/leetcode/blob/master/problems/1697.checking-existence-of-edge-length-limited-paths.md
1737. 满足三条件之一需改变的最少字符数	https://github.com/helihui/leetcode/blob/master/problems/1737.change-minimum-characters-to-satisfy-one-of-three-conditions.md
1770. 执行乘法运算的最大分数	https://github.com/helihui/leetcode/blob/master/problems/1770.maximum-score-from-performing-multiplication-operations.md
1793. 好子数组的最大分数	https://github.com/helihui/leetcode/blob/master/problems/1793.maximum-score-of-a-good-subarray.md
1834. 单线程 CPU	https://github.com/helihui/leetcode/blob/master/problems/1834.single-threaded-cpu.md
1899. 合并若干三元组以形成目标三元组	https://github.com/helihui/leetcode/blob/master/problems/1899.merge-triplets-to-form-target-triplet.md
1904. 你完成的完整对局数	https://github.com/helihui/leetcode/blob/master/problems/1904.the-number-of-full-rounds-you-have-played.md
1906. 查询差绝对值的最小值	https://github.com/helihui/leetcode/blob/master/problems/1906.minimum-absolute-difference-queries.md
2007. 从双倍数组中还原原数组	https://github.com/helihui/leetcode/blob/master/problems/2007.find-original-array-from-doubled-array.md
2008. 出租车的最大盈利	https://github.com/helihui/leetcode/blob/master/problems/2008.maximum-earnings-from-taxi.md
2592. 最大化数组的伟大值	https://github.com/helihui/leetcode/blob/master/problems/2592.maximize-greatness-of-an-array.md
2593. 标记所有元素后数组的分数	https://github.com/helihui/leetcode/blob/master/problems/2593.find-score-of-an-array-after-marking-all-elements.md
2817. 限制条件下元素之间的最小绝对差	https://github.com/helihui/leetcode/blob/master/problems/2817.minimum-absolute-difference-between-elements-with-constraint.md
2865. 美丽塔 I	https://github.com/helihui/leetcode/blob/master/problems/2865.beautiful-towers-i.md
2866. 美丽塔 II	https://github.com/helihui/leetcode/blob/master/problems/2866.beautiful-towers-ii.md
2939. 最大异或乘积	https://github.com/helihui/leetcode/blob/master/problems/2939.maximum-xor-product.md
5935. 适合打劫银行的日子	https://github.com/helihui/leetcode/blob/master/problems/5935.find-good-days-to-rob-the-bank.md
5936. 引爆最多的炸弹	https://github.com/helihui/leetcode/blob/master/problems/5936.detonate-the-maximum-bombs.md
5965. 相同元素的间隔之和	https://github.com/helihui/leetcode/blob/master/problems/5965.intervals-between-identical-elements.md
6021. 字符串中最多数目的子字符串	https://github.com/helihui/leetcode/blob/master/problems/6201.maximize-number-of-subsequences-in-a-string.md
	https://github.com/helihui/leetcode#困难难度题目合集
LCP 20. 快速公交	https://github.com/helihui/leetcode/blob/master/problems/lcp20.meChtZ.md
LCP 21. 追逐游戏	https://github.com/helihui/leetcode/blob/master/problems/lcp21.Za25hA.md
Number Stream to Intervals	https://github.com/helihui/leetcode/blob/master/problems/Number-Stream-to-Intervals.md
Triple Inversion	https://github.com/helihui/leetcode/blob/master/problems/Triple-Inversion.md
Kth Pair Distance	https://github.com/helihui/leetcode/blob/master/problems/Kth-Pair-Distance.md
Minimum Light Radius	https://github.com/helihui/leetcode/blob/master/problems/Minimum-Light-Radius.md
Largest Equivalent Set of Pairs	https://github.com/helihui/leetcode/blob/master/problems/Largest-Equivalent-Set-of-Pairs.md
Ticket-Order.md	https://github.com/helihui/leetcode/blob/master/problems/Ticket-Order.md
Connected-Road-to-Destination	https://github.com/helihui/leetcode/blob/master/problems/Connected-Road-to-Destination.md
0004. 寻找两个正序数组的中位数	https://github.com/helihui/leetcode/blob/master/problems/4.median-of-two-sorted-arrays.md
0023. 合并 K 个升序链表	https://github.com/helihui/leetcode/blob/master/problems/23.merge-k-sorted-lists.md
0025. K 个一组翻转链表	https://github.com/helihui/leetcode/blob/master/problems/25.reverse-nodes-in-k-groups.md
0030. 串联所有单词的子串	https://github.com/helihui/leetcode/blob/master/problems/30.substring-with-concatenation-of-all-words.md
0032. 最长有效括号	https://github.com/helihui/leetcode/blob/master/problems/32.longest-valid-parentheses.md
0042. 接雨水	https://github.com/helihui/leetcode/blob/master/problems/42.trapping-rain-water.md
0052. N 皇后 II	https://github.com/helihui/leetcode/blob/master/problems/52.N-Queens-II.md
0057. 插入区间	https://github.com/helihui/leetcode/blob/master/problems/57.insert-interval.md
0065. 有效数字	https://github.com/helihui/leetcode/blob/master/problems/65.valid-number.md
0084. 柱状图中最大的矩形	https://github.com/helihui/leetcode/blob/master/problems/84.largest-rectangle-in-histogram.md
0085. 最大矩形	https://github.com/helihui/leetcode/blob/master/problems/85.maximal-rectangle.md
0087. 扰乱字符串	https://github.com/helihui/leetcode/blob/master/problems/87.scramble-string.md
0124. 二叉树中的最大路径和	https://github.com/helihui/leetcode/blob/master/problems/124.binary-tree-maximum-path-sum.md
0128. 最长连续序列	https://github.com/helihui/leetcode/blob/master/problems/128.longest-consecutive-sequence.md
0132. 分割回文串 II	https://github.com/helihui/leetcode/blob/master/problems/132.palindrome-partitioning-ii.md
0140. 单词拆分 II	https://github.com/helihui/leetcode/blob/master/problems/140.word-break-ii.md
0145. 二叉树的后序遍历	https://github.com/helihui/leetcode/blob/master/problems/145.binary-tree-postorder-traversal.md
0146. LRU 缓存机制	https://github.com/helihui/leetcode/blob/master/problems/146.lru-cache.md
0154. 寻找旋转排序数组中的最小值 II	https://github.com/helihui/leetcode/blob/master/problems/154.find-minimum-in-rotated-sorted-array-ii.md
0212. 单词搜索 II	https://github.com/helihui/leetcode/blob/master/problems/212.word-search-ii.md
0239. 滑动窗口最大值	https://github.com/helihui/leetcode/blob/master/problems/239.sliding-window-maximum.md
0295. 数据流的中位数	https://github.com/helihui/leetcode/blob/master/problems/295.find-median-from-data-stream.md
0297. 二叉树的序列化与反序列化	https://github.com/helihui/leetcode/blob/master/problems/297.serialize-and-deserialize-binary-tree.md
0301. 删除无效的括号	https://github.com/helihui/leetcode/blob/master/problems/301.remove-invalid-parentheses.md
0312. 戳气球	https://github.com/helihui/leetcode/blob/master/problems/312.burst-balloons.md
330. 按要求补齐数组	https://github.com/helihui/leetcode/blob/master/problems/330.patching-array.md
0335. 路径交叉	https://github.com/helihui/leetcode/blob/master/problems/335.self-crossing.md
0460. LFU 缓存	https://github.com/helihui/leetcode/blob/master/problems/460.lfu-cache.md
0472. 连接词	https://github.com/helihui/leetcode/blob/master/problems/472.concatenated-words.md
0480. 滑动窗口中位数	https://github.com/helihui/leetcode/blob/master/problems/480.sliding-window-median.md
0483. 最小好进制	https://github.com/helihui/leetcode/blob/master/problems/483.smallest-good-base.md
0488. 祖玛游戏	https://github.com/helihui/leetcode/blob/master/problems/488.zuma-game.md
0493. 翻转对	https://github.com/helihui/leetcode/blob/master/problems/493.reverse-pairs.md
0664. 奇怪的打印机	https://github.com/helihui/leetcode/blob/master/problems/664.strange-printer.md
0679. 24 点游戏	https://github.com/helihui/leetcode/blob/master/problems/679.24-game.md
0715. Range 模块	https://github.com/helihui/leetcode/blob/master/problems/715.range-module.md
0726. 原子的数量	https://github.com/helihui/leetcode/blob/master/problems/726.number-of-atoms.md
0768. 最多能完成排序的块 II	https://github.com/helihui/leetcode/blob/master/problems/768.max-chunks-to-make-sorted-ii.md
0805. 数组的均值分割	https://github.com/helihui/leetcode/blob/master/problems/805.split-array-with-same-average.md
0839. 相似字符串组	https://github.com/helihui/leetcode/blob/master/problems/839.similar-string-groups.md
0887. 鸡蛋掉落	https://github.com/helihui/leetcode/blob/master/problems/887.super-egg-drop.md
0895. 最大频率栈	https://github.com/helihui/leetcode/blob/master/problems/895.maximum-frequency-stack.md
0909. 蛇梯棋	https://github.com/helihui/leetcode/blob/master/problems/909.snakes-and-ladders.md
0975. 奇偶跳	https://github.com/helihui/leetcode/blob/master/problems/975.odd-even-jump.md
0995. K 连续位的最小翻转次数	https://github.com/helihui/leetcode/blob/master/problems/995.minimum-number-of-k-consecutive-bit-flips.md
1032. 字符流	https://github.com/helihui/leetcode/blob/master/problems/1032.stream-of-characters.md
1168. 水资源分配优化	https://github.com/helihui/leetcode/blob/master/problems/1168.optimize-water-distribution-in-a-village.md
1178. 猜字谜	https://github.com/helihui/leetcode/blob/master/problems/1178.number-of-valid-words-for-each-puzzle.md
1203. 项目管理	https://github.com/helihui/leetcode/blob/master/problems/1203.sort-items-by-groups-respecting-dependencies.md
1255. 得分最高的单词集合	https://github.com/helihui/leetcode/blob/master/problems/1255.maximum-score-words-formed-by-letters.md
1345. 跳跃游戏 IV	https://github.com/helihui/leetcode/blob/master/problems/1435.jump-game-iv.md
1449. 数位成本和为目标值的最大数字	https://github.com/helihui/leetcode/blob/master/problems/1449.form-largest-integer-with-digits-that-add-up-to-target.md
1494. 并行课程 II	https://github.com/helihui/leetcode/blob/master/problems/1494.parallel-courses-ii.md
1521. 找到最接近目标值的函数值	https://github.com/helihui/leetcode/blob/master/problems/1521.find-a-value-of-a-mysterious-function-closest-to-target.md
1526. 形成目标数组的子数组最少增加次数	https://github.com/helihui/leetcode/blob/master/problems/1526.minimum-number-of-increments-on-subarrays-to-form-a-target-array.md
1639. 通过给定词典构造目标字符串的方案数	https://github.com/helihui/leetcode/blob/master/problems/1639.number-of-ways-to-form-a-target-string-given-a-dictionary.md
1649. 通过指令创建有序数组	https://github.com/helihui/leetcode/blob/master/problems/1649.create-sorted-array-through-instructions.md
1671. 得到山形数组的最少删除次数	https://github.com/helihui/leetcode/blob/master/problems/1671.minimum-number-of-removals-to-make-mountain-array.md
1707. 与数组中元素的最大异或值	https://github.com/helihui/leetcode/blob/master/problems/5640.maximum-xor-with-an-element-from-array.md
1713. 得到子序列的最少操作次数	https://github.com/helihui/leetcode/blob/master/problems/1713.minimum-operations-to-make-a-subsequence.md
1723. 完成所有工作的最短时间	https://github.com/helihui/leetcode/blob/master/problems/1723.find-minimum-time-to-finish-all-jobs.md
1787. 使所有区间的异或结果为零	https://github.com/helihui/leetcode/blob/master/problems/1787.make-the-xor-of-all-segments-equal-to-zero.md
1835. 所有数对按位与结果的异或和	https://github.com/helihui/leetcode/blob/master/problems/1835.find-xor-sum-of-all-pairs-bitwise-and.md
1871. 跳跃游戏 VII	https://github.com/helihui/leetcode/blob/master/problems/1871.jump-game-vii.md
1872. 石子游戏 VIII	https://github.com/helihui/leetcode/blob/master/problems/1872.stone-game-viii.md
1883. 准时抵达会议现场的最小跳过休息次数	https://github.com/helihui/leetcode/blob/master/problems/5775.minimum-skips-to-arrive-at-meeting-on-time.md
1970. 你能穿过矩阵的最后一天	https://github.com/helihui/leetcode/blob/master/problems/1970.last-day-where-you-can-still-cross.md
2009. 使数组连续的最少操作数	https://github.com/helihui/leetcode/blob/master/problems/2009.minimum-number-of-operations-to-make-array-continuous.md
2025. 分割数组的最多方案数	https://github.com/helihui/leetcode/blob/master/problems/2025.maximum-number-of-ways-to-partition-an-array.md
2030. 含特定字母的最小子序列	https://github.com/helihui/leetcode/blob/master/problems/2030.smallest-k-length-subsequence-with-occurrences-of-a-letter.md
2102. 序列顺序查询	https://github.com/helihui/leetcode/blob/master/problems/2102.sequentially-ordinal-rank-tracker.md
2141. 同时运行 N 台电脑的最长时间	https://github.com/helihui/leetcode/blob/master/problems/2141.maximum-running-time-of-n-computers.md
2179. 统计数组中好三元组数目	https://github.com/helihui/leetcode/blob/master/problems/2179.count-good-triplets-in-an-array.md
2209. 用地毯覆盖后的最少白色砖块	https://github.com/helihui/leetcode/blob/master/problems/2209.minimum-white-tiles-after-covering-with-carpets.md
2281. 巫师的总力量和	https://github.com/helihui/leetcode/blob/master/problems/2281.sum-of-total-strength-of-wizards.md
2306. 公司命名	https://github.com/helihui/leetcode/blob/master/problems/2306.naming-a-company.md
2312. 卖木头块	https://github.com/helihui/leetcode/blob/master/problems/2312.selling-pieces-of-wood.md
2842. 统计一个字符串的 k 子序列美丽值最大的数目	https://github.com/helihui/leetcode/blob/master/problems/2842.count-k-subsequences-of-a-string-with-maximum-beauty.md
2972. 统计移除递增子数组的数目 II	https://github.com/helihui/leetcode/blob/master/problems/2972.count-the-number-of-incremovable-subarrays-ii.md
3027. 人员站位的方案数 II	https://github.com/helihui/leetcode/blob/master/problems/3027.find-the-number-of-ways-to-place-people-ii.md
3041. 修改数组后最大化数组中的连续元素数目	https://github.com/helihui/leetcode/blob/master/problems/3041.maximize-consecutive-elements-in-an-array-after-modification.md
3108. 带权图里旅途的最小代价	https://github.com/helihui/leetcode/blob/master/problems/3108.minimum-cost-walk-in-weighted-graph.md
	https://github.com/helihui/leetcode#trident-anki-卡片
anki-card	https://github.com/helihui/leetcode/blob/master/assets/anki/leetcode.apkg
anki 官网	https://apps.ankiweb.net/
	https://github.com/helihui/leetcode#关于我
	https://camo.githubusercontent.com/6a7da4279dce9bef871a881ed8fbacee3c349047c7c23346a9a166b7a9e0e922/68747470733a2f2f702e697069632e7669702f7763697a316e2e6a7067
	https://github.com/helihui/leetcode#chart_with_upwards_trend-大事件
纪念项目 Star 突破 1W 的一个短文	https://github.com/helihui/leetcode/blob/master/thanksGiving.md
纪念 LeetCode 项目 Star 突破 2W	https://github.com/helihui/leetcode/blob/master/thanksGiving2.md
项目突破三万 Star	https://github.com/helihui/leetcode/blob/master/thanksGiving3.md
http://leetcode-solution.cn/	http://leetcode-solution.cn/
	https://camo.githubusercontent.com/eab84d5d19e9237f8a3a0df65020142aa050f97ac52b0e197b987595b51c9e18/68747470733a2f2f702e697069632e7669702f3938703139622e6a7067
	https://github.com/helihui/leetcode#gift_heart-贡献
issue	https://github.com/azl397985856/leetcode/issues
贡献指南	https://github.com/helihui/leetcode/blob/master/CONTRIBUTING.md
指南	https://github.com/helihui/leetcode/blob/master/templates/problems/1014.best-sightseeing-pair.md
这里	https://github.com/helihui/leetcode/blob/master/assets/drawio
draw.io	https://www.draw.io/
	https://github.com/helihui/leetcode#love_letter-鸣谢
小伙伴	https://github.com/azl397985856/leetcode/graphs/contributors
	https://github.com/helihui/leetcode#license
CC BY-NC-ND 4.0	https://github.com/helihui/leetcode/blob/master/LICENSE.txt
leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/	https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/
Readme	https://github.com/helihui/leetcode#readme-ov-file
View license	https://github.com/helihui/leetcode#License-1-ov-file
Please reload this page	https://github.com/helihui/leetcode
Activity	https://github.com/helihui/leetcode/activity
0 forks	https://github.com/helihui/leetcode/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fhelihui%2Fleetcode&report=helihui+%28user%29
Releases	https://github.com/helihui/leetcode/releases
Packages 0	https://github.com/users/helihui/packages?repo_name=leetcode
Please reload this page	https://github.com/helihui/leetcode
Contributors	https://github.com/helihui/leetcode/graphs/contributors
Please reload this page	https://github.com/helihui/leetcode
	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.