René's URL Explorer Experiment

Title: GitHub - codeyu/leetcode-interview: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 · GitHub

Open Graph Title: GitHub - codeyu/leetcode-interview: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解

X Title: GitHub - codeyu/leetcode-interview: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解

Description: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - codeyu/leetcode-interview

Open Graph Description: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - codeyu/leetcode-interview

X Description: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - codeyu/leetcode-interview

Opengraph URL: https://github.com/codeyu/leetcode-interview

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository/tree/name(/path)
route-controller	files
route-action	disambiguate
fetch-nonce	v2:350b44db-e5d7-4c23-4ff7-e02a9b2f7374
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	A782:385E4A:14D29EE:1BF39EF:6A59A48F
html-safe-nonce	f293b69233a8927e5f9a1731dbb0c0a7571121e48ec5ed1e74b4c3526f0b159b
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBNzgyOjM4NUU0QToxNEQyOUVFOjFCRjM5RUY6NkE1OUE0OEYiLCJ2aXNpdG9yX2lkIjoiNDY1MzQ3OTIxNzM5MjYyNDc4MyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac	5a086cdde9671ded26a179923c29fd8172631677dc61bc4efbdada1bc00225ad
hovercard-subject-tag	repository:532292086
github-keyboard-shortcuts	repository,source-code,file-tree,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/codeyu/leetcode-interview/tree/main
twitter:image	https://opengraph.githubassets.com/3e1e38217b4b45d562bbdd38e262b1558d2472652e92f7201868dbcfd1e6d9e1/codeyu/leetcode-interview
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/3e1e38217b4b45d562bbdd38e262b1558d2472652e92f7201868dbcfd1e6d9e1/codeyu/leetcode-interview
og:image:alt	😏 LeetCode solutions in any programming language \| 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - codeyu/leetcode-interview
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	a540949572872b935b393b36db38922db390ae71c859537d741b8f3eb7e545b5
turbo-cache-control	no-cache
go-import	github.com/codeyu/leetcode-interview git https://github.com/codeyu/leetcode-interview.git
octolytics-dimension-user_id	230674
octolytics-dimension-user_login	codeyu
octolytics-dimension-repository_id	532292086
octolytics-dimension-repository_nwo	codeyu/leetcode-interview
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	149001365
octolytics-dimension-repository_parent_nwo	doocs/leetcode
octolytics-dimension-repository_network_root_id	149001365
octolytics-dimension-repository_network_root_nwo	doocs/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	0b971869dd75eec26500a9de7e85b8137c6bf0f6
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/codeyu/leetcode-interview/tree/main#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fcodeyu%2Fleetcode-interview%2Ftree%2Fmain
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%2Fcodeyu%2Fleetcode-interview%2Ftree%2Fmain
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=codeyu%2Fleetcode-interview
Reload	https://github.com/codeyu/leetcode-interview/tree/main
Reload	https://github.com/codeyu/leetcode-interview/tree/main
Reload	https://github.com/codeyu/leetcode-interview/tree/main
codeyu	https://github.com/codeyu
leetcode-interview	https://github.com/codeyu/leetcode-interview
doocs/leetcode	https://github.com/doocs/leetcode
Notifications	https://github.com/login?return_to=%2Fcodeyu%2Fleetcode-interview
Fork 1	https://github.com/login?return_to=%2Fcodeyu%2Fleetcode-interview
Star 0	https://github.com/login?return_to=%2Fcodeyu%2Fleetcode-interview
Code	https://github.com/codeyu/leetcode-interview
Pull requests 0	https://github.com/codeyu/leetcode-interview/pulls
Actions	https://github.com/codeyu/leetcode-interview/actions
Projects	https://github.com/codeyu/leetcode-interview/projects
Security and quality 0	https://github.com/codeyu/leetcode-interview/security
Insights	https://github.com/codeyu/leetcode-interview/pulse
Code	https://github.com/codeyu/leetcode-interview
Pull requests	https://github.com/codeyu/leetcode-interview/pulls
Actions	https://github.com/codeyu/leetcode-interview/actions
Projects	https://github.com/codeyu/leetcode-interview/projects
Security and quality	https://github.com/codeyu/leetcode-interview/security
Insights	https://github.com/codeyu/leetcode-interview/pulse
	https://github.com/codeyu/leetcode-interview
Branches	https://github.com/codeyu/leetcode-interview/branches
Tags	https://github.com/codeyu/leetcode-interview/tags
	https://github.com/codeyu/leetcode-interview/branches
	https://github.com/codeyu/leetcode-interview/tags
5,721 Commits	https://github.com/codeyu/leetcode-interview/commits/main/
	https://github.com/codeyu/leetcode-interview/commits/main/
.github	https://github.com/codeyu/leetcode-interview/tree/main/.github
.github	https://github.com/codeyu/leetcode-interview/tree/main/.github
basic	https://github.com/codeyu/leetcode-interview/tree/main/basic
basic	https://github.com/codeyu/leetcode-interview/tree/main/basic
images	https://github.com/codeyu/leetcode-interview/tree/main/images
images	https://github.com/codeyu/leetcode-interview/tree/main/images
lcci	https://github.com/codeyu/leetcode-interview/tree/main/lcci
lcci	https://github.com/codeyu/leetcode-interview/tree/main/lcci
lcof	https://github.com/codeyu/leetcode-interview/tree/main/lcof
lcof	https://github.com/codeyu/leetcode-interview/tree/main/lcof
lcof2	https://github.com/codeyu/leetcode-interview/tree/main/lcof2
lcof2	https://github.com/codeyu/leetcode-interview/tree/main/lcof2
lcp	https://github.com/codeyu/leetcode-interview/tree/main/lcp
lcp	https://github.com/codeyu/leetcode-interview/tree/main/lcp
lcs	https://github.com/codeyu/leetcode-interview/tree/main/lcs
lcs	https://github.com/codeyu/leetcode-interview/tree/main/lcs
solution	https://github.com/codeyu/leetcode-interview/tree/main/solution
solution	https://github.com/codeyu/leetcode-interview/tree/main/solution
.clang-format	https://github.com/codeyu/leetcode-interview/blob/main/.clang-format
.clang-format	https://github.com/codeyu/leetcode-interview/blob/main/.clang-format
.gitignore	https://github.com/codeyu/leetcode-interview/blob/main/.gitignore
.gitignore	https://github.com/codeyu/leetcode-interview/blob/main/.gitignore
.nojekyll	https://github.com/codeyu/leetcode-interview/blob/main/.nojekyll
.nojekyll	https://github.com/codeyu/leetcode-interview/blob/main/.nojekyll
.prettierignore	https://github.com/codeyu/leetcode-interview/blob/main/.prettierignore
.prettierignore	https://github.com/codeyu/leetcode-interview/blob/main/.prettierignore
.prettierrc	https://github.com/codeyu/leetcode-interview/blob/main/.prettierrc
.prettierrc	https://github.com/codeyu/leetcode-interview/blob/main/.prettierrc
CODE_OF_CONDUCT.md	https://github.com/codeyu/leetcode-interview/blob/main/CODE_OF_CONDUCT.md
CODE_OF_CONDUCT.md	https://github.com/codeyu/leetcode-interview/blob/main/CODE_OF_CONDUCT.md
LICENSE	https://github.com/codeyu/leetcode-interview/blob/main/LICENSE
LICENSE	https://github.com/codeyu/leetcode-interview/blob/main/LICENSE
README.md	https://github.com/codeyu/leetcode-interview/blob/main/README.md
README.md	https://github.com/codeyu/leetcode-interview/blob/main/README.md
README_EN.md	https://github.com/codeyu/leetcode-interview/blob/main/README_EN.md
README_EN.md	https://github.com/codeyu/leetcode-interview/blob/main/README_EN.md
index.html	https://github.com/codeyu/leetcode-interview/blob/main/index.html
index.html	https://github.com/codeyu/leetcode-interview/blob/main/index.html
package-lock.json	https://github.com/codeyu/leetcode-interview/blob/main/package-lock.json
package-lock.json	https://github.com/codeyu/leetcode-interview/blob/main/package-lock.json
package.json	https://github.com/codeyu/leetcode-interview/blob/main/package.json
package.json	https://github.com/codeyu/leetcode-interview/blob/main/package.json
run_format.py	https://github.com/codeyu/leetcode-interview/blob/main/run_format.py
run_format.py	https://github.com/codeyu/leetcode-interview/blob/main/run_format.py
summary.md	https://github.com/codeyu/leetcode-interview/blob/main/summary.md
summary.md	https://github.com/codeyu/leetcode-interview/blob/main/summary.md
summary_en.md	https://github.com/codeyu/leetcode-interview/blob/main/summary_en.md
summary_en.md	https://github.com/codeyu/leetcode-interview/blob/main/summary_en.md
vercel.json	https://github.com/codeyu/leetcode-interview/blob/main/vercel.json
vercel.json	https://github.com/codeyu/leetcode-interview/blob/main/vercel.json
README	https://github.com/codeyu/leetcode-interview/tree/main
Code of conduct	https://github.com/codeyu/leetcode-interview/tree/main
License	https://github.com/codeyu/leetcode-interview/tree/main
	https://github.com/doocs/leetcode
	https://github.com/doocs/leetcode
	https://doocs.github.io/#/?id=how-to-join
	https://github.com/doocs/leetcode/blob/main/LICENSE
	https://opencollective.com/doocs-leetcode/backers/badge.svg
	https://github.com/doocs/leetcode/stargazers
	https://github.com/doocs/leetcode/network/members
	https://opencollective.com/doocs-leetcode/sponsors/badge.svg
	https://github.com/codeyu/leetcode-interview/tree/main#介绍
本项目	https://github.com/doocs/leetcode
English Version	https://github.com/codeyu/leetcode-interview/blob/main/README_EN.md
	https://github.com/codeyu/leetcode-interview/tree/main#站点
https://doocs-leetcode.vercel.app	https://doocs-leetcode.vercel.app
https://doocs.github.io/leetcode	https://doocs.github.io/leetcode
	https://github.com/codeyu/leetcode-interview/tree/main#算法全解
LeetCode	https://github.com/codeyu/leetcode-interview/blob/main/solution/README.md
往期竞赛合集	https://github.com/codeyu/leetcode-interview/blob/main/solution/CONTEST_README.md
剑指 Offer（第 2 版）	https://github.com/codeyu/leetcode-interview/blob/main/lcof/README.md
剑指 Offer（专项突击版）	https://github.com/codeyu/leetcode-interview/blob/main/lcof2/README.md
程序员面试金典（第 6 版）	https://github.com/codeyu/leetcode-interview/blob/main/lcci/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#算法提升专题
	https://github.com/codeyu/leetcode-interview/tree/main#1-基础算法
在排序数组中查找元素的第一个和最后一个位置	https://github.com/codeyu/leetcode-interview/blob/main/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md
准时到达的列车最小时速	https://github.com/codeyu/leetcode-interview/blob/main/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md
找到需要补充粉笔的学生编号	https://github.com/codeyu/leetcode-interview/blob/main/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md
可移除字符的最大数目	https://github.com/codeyu/leetcode-interview/blob/main/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md
排序数组	https://github.com/codeyu/leetcode-interview/blob/main/solution/0900-0999/0912.Sort%20an%20Array/README.md
字符串相加	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0415.Add%20Strings/README.md
字符串相乘	https://github.com/codeyu/leetcode-interview/blob/main/solution/0000-0099/0043.Multiply%20Strings/README.md
区域和检索 - 数组不可变	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md
二维区域和检索 - 矩阵不可变	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md
区间加法	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0370.Range%20Addition/README.md
用邮票贴满网格图	https://github.com/codeyu/leetcode-interview/blob/main/solution/2100-2199/2132.Stamping%20the%20Grid/README.md
无重复字符的最长子串	https://github.com/codeyu/leetcode-interview/blob/main/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md
乘积小于 K 的子数组	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md
位 1 的个数	https://github.com/codeyu/leetcode-interview/blob/main/solution/0100-0199/0191.Number%20of%201%20Bits/README.md
合并区间	https://github.com/codeyu/leetcode-interview/blob/main/solution/0000-0099/0056.Merge%20Intervals/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#2-数据结构
设计链表	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0707.Design%20Linked%20List/README.md
下一个更大元素 I	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md
每日温度	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0739.Daily%20Temperatures/README.md
子数组的最小值之和	https://github.com/codeyu/leetcode-interview/blob/main/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md
最大宽度坡	https://github.com/codeyu/leetcode-interview/blob/main/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md
最多能完成排序的块 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md
子数组范围和	https://github.com/codeyu/leetcode-interview/blob/main/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md
子数组最小乘积的最大值	https://github.com/codeyu/leetcode-interview/blob/main/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md
滑动窗口最大值	https://github.com/codeyu/leetcode-interview/blob/main/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md
满足不等式的最大值	https://github.com/codeyu/leetcode-interview/blob/main/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md
和至少为 K 的最短子数组	https://github.com/codeyu/leetcode-interview/blob/main/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md
带限制的子序列和	https://github.com/codeyu/leetcode-interview/blob/main/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md
单词规律 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/0200-0299/0291.Word%20Pattern%20II/README.md
最短回文串	https://github.com/codeyu/leetcode-interview/blob/main/solution/0200-0299/0214.Shortest%20Palindrome/README.md
回文对	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0336.Palindrome%20Pairs/README.md
最长重复子串	https://github.com/codeyu/leetcode-interview/blob/main/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md
不同的循环子字符串	https://github.com/codeyu/leetcode-interview/blob/main/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#3-搜索
图像渲染	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0733.Flood%20Fill/README.md
岛屿数量	https://github.com/codeyu/leetcode-interview/blob/main/solution/0200-0299/0200.Number%20of%20Islands/README.md
01 矩阵	https://github.com/codeyu/leetcode-interview/blob/main/solution/0500-0599/0542.01%20Matrix/README.md
地图中的最高点	https://github.com/codeyu/leetcode-interview/blob/main/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md
进击的骑士	https://github.com/codeyu/leetcode-interview/blob/main/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md
二进制矩阵中的最短路径	https://github.com/codeyu/leetcode-interview/blob/main/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md
迷宫中离入口最近的出口	https://github.com/codeyu/leetcode-interview/blob/main/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md
网格中的最短路径	https://github.com/codeyu/leetcode-interview/blob/main/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md
打开转盘锁	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0752.Open%20the%20Lock/README.md
单词接龙	https://github.com/codeyu/leetcode-interview/blob/main/solution/0100-0199/0127.Word%20Ladder/README.md
转化数字的最小运算数	https://github.com/codeyu/leetcode-interview/blob/main/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md
滑动谜题	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0773.Sliding%20Puzzle/README.md
访问所有节点的最短路径	https://github.com/codeyu/leetcode-interview/blob/main/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md
为高尔夫比赛砍树	https://github.com/codeyu/leetcode-interview/blob/main/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md
使网格图至少有一条有效路径的最小代价	https://github.com/codeyu/leetcode-interview/blob/main/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md
到达角落需要移除障碍物的最小数目	https://github.com/codeyu/leetcode-interview/blob/main/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md
迷宫	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0490.The%20Maze/README.md
单词搜索	https://github.com/codeyu/leetcode-interview/blob/main/solution/0000-0099/0079.Word%20Search/README.md
黄金矿工	https://github.com/codeyu/leetcode-interview/blob/main/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md
火柴拼正方形	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md
划分为 k 个相等的子集	https://github.com/codeyu/leetcode-interview/blob/main/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md
完成所有工作的最短时间	https://github.com/codeyu/leetcode-interview/blob/main/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md
公平分发饼干	https://github.com/codeyu/leetcode-interview/blob/main/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md
矩阵中的最长递增路径	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md
网格图中递增路径的数目	https://github.com/codeyu/leetcode-interview/blob/main/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md
翻转游戏 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/0200-0299/0294.Flip%20Game%20II/README.md
统计所有可行路径	https://github.com/codeyu/leetcode-interview/blob/main/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md
切披萨的方案数	https://github.com/codeyu/leetcode-interview/blob/main/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#4-动态规划dp
杨辉三角	https://github.com/codeyu/leetcode-interview/blob/main/solution/0100-0199/0118.Pascal's%20Triangle/README.md
最小路径和	https://github.com/codeyu/leetcode-interview/blob/main/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md
摘樱桃	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0741.Cherry%20Pickup/README.md
摘樱桃 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md
最长递增子序列	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md
无重叠区间	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md
删列造序 III	https://github.com/codeyu/leetcode-interview/blob/main/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md
俄罗斯套娃信封问题	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md
堆叠长方体的最大高度	https://github.com/codeyu/leetcode-interview/blob/main/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md
无矛盾的最佳球队	https://github.com/codeyu/leetcode-interview/blob/main/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md
最长公共子序列	https://github.com/codeyu/leetcode-interview/blob/main/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md
两个字符串的最小 ASCII 删除和	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md
两个字符串的删除操作	https://github.com/codeyu/leetcode-interview/blob/main/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md
目标和	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0494.Target%20Sum/README.md
分割等和子集	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md
最后一块石头的重量 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md
零钱兑换	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0322.Coin%20Change/README.md
组合总和 Ⅳ	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0377.Combination%20Sum%20IV/README.md
从栈中取出 K 个硬币的最大面值和	https://github.com/codeyu/leetcode-interview/blob/main/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#5-高级数据结构
二维网格图中探测环	https://github.com/codeyu/leetcode-interview/blob/main/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md
除法求值	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0399.Evaluate%20Division/README.md
由斜杠划分区域	https://github.com/codeyu/leetcode-interview/blob/main/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md
水位上升的泳池中游泳	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md
交换字符串中的元素	https://github.com/codeyu/leetcode-interview/blob/main/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md
打砖块	https://github.com/codeyu/leetcode-interview/blob/main/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md
尽量减少恶意软件的传播 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md
检查边长度限制的路径是否存在	https://github.com/codeyu/leetcode-interview/blob/main/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md
保证图可完全遍历	https://github.com/codeyu/leetcode-interview/blob/main/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md
区域和检索 - 数组可修改	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md
通过指令创建有序数组	https://github.com/codeyu/leetcode-interview/blob/main/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md
统计数组中好三元组数目	https://github.com/codeyu/leetcode-interview/blob/main/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md
最多 K 次交换相邻数位后得到的最小整数	https://github.com/codeyu/leetcode-interview/blob/main/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md
二维区域和检索 - 可变	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md
计算右侧小于当前元素的个数	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md
区间和的个数	https://github.com/codeyu/leetcode-interview/blob/main/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md
翻转对	https://github.com/codeyu/leetcode-interview/blob/main/solution/0400-0499/0493.Reverse%20Pairs/README.md
最长递增子序列的个数	https://github.com/codeyu/leetcode-interview/blob/main/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md
奇妙序列	https://github.com/codeyu/leetcode-interview/blob/main/solution/1600-1699/1622.Fancy%20Sequence/README.md
Range 模块	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0715.Range%20Module/README.md
我的日程安排表 III	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0732.My%20Calendar%20III/README.md
每天绘制的新区域数量	https://github.com/codeyu/leetcode-interview/blob/main/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md
由单个字符重复的最长子字符串	https://github.com/codeyu/leetcode-interview/blob/main/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md
矩形面积 II	https://github.com/codeyu/leetcode-interview/blob/main/solution/0800-0899/0850.Rectangle%20Area%20II/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#6-图论
网络延迟时间	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0743.Network%20Delay%20Time/README.md
得到要求路径的最小带权子图	https://github.com/codeyu/leetcode-interview/blob/main/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md
连接所有点的最小费用	https://github.com/codeyu/leetcode-interview/blob/main/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md
最低成本联通所有城市	https://github.com/codeyu/leetcode-interview/blob/main/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md
水资源分配优化	https://github.com/codeyu/leetcode-interview/blob/main/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md
找到最小生成树里的关键边和伪关键边	https://github.com/codeyu/leetcode-interview/blob/main/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md
判断二分图	https://github.com/codeyu/leetcode-interview/blob/main/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md
	https://github.com/codeyu/leetcode-interview/tree/main#加入我们
@kfstorm	https://github.com/kfstorm
C# 题解	https://github.com/doocs/leetcode/pull/245
PR	https://github.com/doocs/leetcode/pulls
https://help.github.com/cn	https://help.github.com/cn
	https://github.com/doocs/leetcode
Gitpod.io	https://www.gitpod.io
	https://gitpod.io/#https://github.com/doocs/leetcode
	https://github.com/codeyu/leetcode-interview/tree/main#stars-趋势
	https://github.com/doocs/leetcode/stargazers
	https://github.com/codeyu/leetcode-interview/tree/main#贡献者
	https://github.com/doocs/leetcode/graphs/contributors
	https://github.com/codeyu/leetcode-interview/tree/main#赞助者
	https://opencollective.com/doocs-leetcode/backers.svg?width=890
	https://opencollective.com/doocs-leetcode/sponsors.svg?width=890
Alan Yessenbayev	https://opencollective.com/alan-yessenbayev
	https://github.com/codeyu/leetcode-interview/tree/main#推荐者
@爱可可-爱生活	https://weibo.com/fly51fly
	https://weibo.com/fly51fly
	https://github.com/codeyu/leetcode-interview/tree/main#许可证
知识共享版权归属-相同方式共享 4.0 国际公共许可证	http://creativecommons.org/licenses/by-sa/4.0/
doocs.github.io/leetcode	https://doocs.github.io/leetcode
Readme	https://github.com/codeyu/leetcode-interview/tree/main#readme-ov-file
CC-BY-SA-4.0 license	https://github.com/codeyu/leetcode-interview/tree/main#CC-BY-SA-4.0-1-ov-file
Code of conduct	https://github.com/codeyu/leetcode-interview/tree/main#coc-ov-file
Please reload this page	https://github.com/codeyu/leetcode-interview/tree/main
Activity	https://github.com/codeyu/leetcode-interview/activity
1 fork	https://github.com/codeyu/leetcode-interview/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fcodeyu%2Fleetcode-interview&report=codeyu+%28user%29
Releases	https://github.com/codeyu/leetcode-interview/releases
Packages 0	https://github.com/users/codeyu/packages?repo_name=leetcode-interview
Please reload this page	https://github.com/codeyu/leetcode-interview/tree/main
Contributors	https://github.com/codeyu/leetcode-interview/graphs/contributors
Please reload this page	https://github.com/codeyu/leetcode-interview/tree/main
	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.