René's URL Explorer Experiment


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

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

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

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

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

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

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

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:46c8559a-0b78-aed9-61b7-4df029dd2639
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idC964:3A24D:1C46838:25CF10A:6A598279
html-safe-noncef62cb3b786e088cbc077b3054c6957fd7590cabca4d630e4422ac044e94911db
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDOTY0OjNBMjREOjFDNDY4Mzg6MjVDRjEwQTo2QTU5ODI3OSIsInZpc2l0b3JfaWQiOiI3NzQ3NTA3MzIxNjYxMTI5MzM3IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac7c16ec370301c9a485d2c8ed3f456a12530cb8289c4404c20238de6adaf365c0
hovercard-subject-tagrepository:529087343
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/ovaldi/leetcode
twitter:imagehttps://opengraph.githubassets.com/7db7ca8a1ebb1355c401c1dd2ab1bbdae84c2dd6446fe522d059a8ec9f3368e5/ovaldi/leetcode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/7db7ca8a1ebb1355c401c1dd2ab1bbdae84c2dd6446fe522d059a8ec9f3368e5/ovaldi/leetcode
og:image:alt😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - ovaldi/leetcode
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Nonea540949572872b935b393b36db38922db390ae71c859537d741b8f3eb7e545b5
turbo-cache-controlno-cache
go-importgithub.com/ovaldi/leetcode git https://github.com/ovaldi/leetcode.git
octolytics-dimension-user_id4537336
octolytics-dimension-user_loginovaldi
octolytics-dimension-repository_id529087343
octolytics-dimension-repository_nwoovaldi/leetcode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id149001365
octolytics-dimension-repository_parent_nwodoocs/leetcode
octolytics-dimension-repository_network_root_id149001365
octolytics-dimension-repository_network_root_nwodoocs/leetcode
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release624bb50a7497aa346bef8cc3743af408a9ea10ca
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/ovaldi/leetcode#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fovaldi%2Fleetcode
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub Copilot appDirect agents from issue to mergehttps://github.com/features/ai/github-app
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
View all resourceshttps://github.com/resources
GitHub SponsorsFund open source developershttps://github.com/open-source/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/open-source/accelerator
GitHub Starshttps://stars.github.com
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/enterprise/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://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%2Fovaldi%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=ovaldi%2Fleetcode
Reloadhttps://github.com/ovaldi/leetcode
Reloadhttps://github.com/ovaldi/leetcode
Reloadhttps://github.com/ovaldi/leetcode
ovaldi https://github.com/ovaldi
leetcodehttps://github.com/ovaldi/leetcode
doocs/leetcodehttps://github.com/doocs/leetcode
Notifications https://github.com/login?return_to=%2Fovaldi%2Fleetcode
Fork 0 https://github.com/login?return_to=%2Fovaldi%2Fleetcode
Star 1 https://github.com/login?return_to=%2Fovaldi%2Fleetcode
Code https://github.com/ovaldi/leetcode
Pull requests 0 https://github.com/ovaldi/leetcode/pulls
Actions https://github.com/ovaldi/leetcode/actions
Projects https://github.com/ovaldi/leetcode/projects
Security and quality 0 https://github.com/ovaldi/leetcode/security
Insights https://github.com/ovaldi/leetcode/pulse
Code https://github.com/ovaldi/leetcode
Pull requests https://github.com/ovaldi/leetcode/pulls
Actions https://github.com/ovaldi/leetcode/actions
Projects https://github.com/ovaldi/leetcode/projects
Security and quality https://github.com/ovaldi/leetcode/security
Insights https://github.com/ovaldi/leetcode/pulse
https://github.com/ovaldi/leetcode
Brancheshttps://github.com/ovaldi/leetcode/branches
Tagshttps://github.com/ovaldi/leetcode/tags
https://github.com/ovaldi/leetcode/branches
https://github.com/ovaldi/leetcode/tags
5,658 Commitshttps://github.com/ovaldi/leetcode/commits/main/
https://github.com/ovaldi/leetcode/commits/main/
.githubhttps://github.com/ovaldi/leetcode/tree/main/.github
.githubhttps://github.com/ovaldi/leetcode/tree/main/.github
basichttps://github.com/ovaldi/leetcode/tree/main/basic
basichttps://github.com/ovaldi/leetcode/tree/main/basic
imageshttps://github.com/ovaldi/leetcode/tree/main/images
imageshttps://github.com/ovaldi/leetcode/tree/main/images
lccihttps://github.com/ovaldi/leetcode/tree/main/lcci
lccihttps://github.com/ovaldi/leetcode/tree/main/lcci
lcofhttps://github.com/ovaldi/leetcode/tree/main/lcof
lcofhttps://github.com/ovaldi/leetcode/tree/main/lcof
lcof2https://github.com/ovaldi/leetcode/tree/main/lcof2
lcof2https://github.com/ovaldi/leetcode/tree/main/lcof2
lcphttps://github.com/ovaldi/leetcode/tree/main/lcp
lcphttps://github.com/ovaldi/leetcode/tree/main/lcp
lcshttps://github.com/ovaldi/leetcode/tree/main/lcs
lcshttps://github.com/ovaldi/leetcode/tree/main/lcs
solutionhttps://github.com/ovaldi/leetcode/tree/main/solution
solutionhttps://github.com/ovaldi/leetcode/tree/main/solution
.clang-formathttps://github.com/ovaldi/leetcode/blob/main/.clang-format
.clang-formathttps://github.com/ovaldi/leetcode/blob/main/.clang-format
.gitignorehttps://github.com/ovaldi/leetcode/blob/main/.gitignore
.gitignorehttps://github.com/ovaldi/leetcode/blob/main/.gitignore
.nojekyllhttps://github.com/ovaldi/leetcode/blob/main/.nojekyll
.nojekyllhttps://github.com/ovaldi/leetcode/blob/main/.nojekyll
.prettierignorehttps://github.com/ovaldi/leetcode/blob/main/.prettierignore
.prettierignorehttps://github.com/ovaldi/leetcode/blob/main/.prettierignore
.prettierrchttps://github.com/ovaldi/leetcode/blob/main/.prettierrc
.prettierrchttps://github.com/ovaldi/leetcode/blob/main/.prettierrc
CODE_OF_CONDUCT.mdhttps://github.com/ovaldi/leetcode/blob/main/CODE_OF_CONDUCT.md
CODE_OF_CONDUCT.mdhttps://github.com/ovaldi/leetcode/blob/main/CODE_OF_CONDUCT.md
LICENSEhttps://github.com/ovaldi/leetcode/blob/main/LICENSE
LICENSEhttps://github.com/ovaldi/leetcode/blob/main/LICENSE
README.mdhttps://github.com/ovaldi/leetcode/blob/main/README.md
README.mdhttps://github.com/ovaldi/leetcode/blob/main/README.md
README_EN.mdhttps://github.com/ovaldi/leetcode/blob/main/README_EN.md
README_EN.mdhttps://github.com/ovaldi/leetcode/blob/main/README_EN.md
index.htmlhttps://github.com/ovaldi/leetcode/blob/main/index.html
index.htmlhttps://github.com/ovaldi/leetcode/blob/main/index.html
package-lock.jsonhttps://github.com/ovaldi/leetcode/blob/main/package-lock.json
package-lock.jsonhttps://github.com/ovaldi/leetcode/blob/main/package-lock.json
package.jsonhttps://github.com/ovaldi/leetcode/blob/main/package.json
package.jsonhttps://github.com/ovaldi/leetcode/blob/main/package.json
run_format.pyhttps://github.com/ovaldi/leetcode/blob/main/run_format.py
run_format.pyhttps://github.com/ovaldi/leetcode/blob/main/run_format.py
summary.mdhttps://github.com/ovaldi/leetcode/blob/main/summary.md
summary.mdhttps://github.com/ovaldi/leetcode/blob/main/summary.md
summary_en.mdhttps://github.com/ovaldi/leetcode/blob/main/summary_en.md
summary_en.mdhttps://github.com/ovaldi/leetcode/blob/main/summary_en.md
vercel.jsonhttps://github.com/ovaldi/leetcode/blob/main/vercel.json
vercel.jsonhttps://github.com/ovaldi/leetcode/blob/main/vercel.json
READMEhttps://github.com/ovaldi/leetcode
Code of conducthttps://github.com/ovaldi/leetcode
Licensehttps://github.com/ovaldi/leetcode
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/ovaldi/leetcode#介绍
本项目https://github.com/doocs/leetcode
English Versionhttps://github.com/ovaldi/leetcode/blob/main/README_EN.md
https://github.com/ovaldi/leetcode#站点
https://doocs-leetcode.vercel.apphttps://doocs-leetcode.vercel.app
https://doocs.github.io/leetcodehttps://doocs.github.io/leetcode
https://github.com/ovaldi/leetcode#算法全解
LeetCodehttps://github.com/ovaldi/leetcode/blob/main/solution/README.md
往期竞赛合集https://github.com/ovaldi/leetcode/blob/main/solution/CONTEST_README.md
剑指 Offer（第 2 版）https://github.com/ovaldi/leetcode/blob/main/lcof/README.md
剑指 Offer（专项突击版）https://github.com/ovaldi/leetcode/blob/main/lcof2/README.md
程序员面试金典（第 6 版）https://github.com/ovaldi/leetcode/blob/main/lcci/README.md
https://github.com/ovaldi/leetcode#算法提升专题
https://github.com/ovaldi/leetcode#1-基础算法
在排序数组中查找元素的第一个和最后一个位置https://github.com/ovaldi/leetcode/blob/main/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md
准时到达的列车最小时速https://github.com/ovaldi/leetcode/blob/main/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md
找到需要补充粉笔的学生编号https://github.com/ovaldi/leetcode/blob/main/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md
可移除字符的最大数目https://github.com/ovaldi/leetcode/blob/main/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md
排序数组https://github.com/ovaldi/leetcode/blob/main/solution/0900-0999/0912.Sort%20an%20Array/README.md
字符串相加https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0415.Add%20Strings/README.md
字符串相乘https://github.com/ovaldi/leetcode/blob/main/solution/0000-0099/0043.Multiply%20Strings/README.md
区域和检索 - 数组不可变https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md
二维区域和检索 - 矩阵不可变https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md
区间加法https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0370.Range%20Addition/README.md
用邮票贴满网格图https://github.com/ovaldi/leetcode/blob/main/solution/2100-2199/2132.Stamping%20the%20Grid/README.md
无重复字符的最长子串https://github.com/ovaldi/leetcode/blob/main/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md
乘积小于 K 的子数组https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md
位 1 的个数https://github.com/ovaldi/leetcode/blob/main/solution/0100-0199/0191.Number%20of%201%20Bits/README.md
合并区间https://github.com/ovaldi/leetcode/blob/main/solution/0000-0099/0056.Merge%20Intervals/README.md
https://github.com/ovaldi/leetcode#2-数据结构
设计链表https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0707.Design%20Linked%20List/README.md
下一个更大元素 Ihttps://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md
每日温度https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0739.Daily%20Temperatures/README.md
子数组的最小值之和https://github.com/ovaldi/leetcode/blob/main/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md
最大宽度坡https://github.com/ovaldi/leetcode/blob/main/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md
最多能完成排序的块 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md
子数组范围和https://github.com/ovaldi/leetcode/blob/main/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md
子数组最小乘积的最大值https://github.com/ovaldi/leetcode/blob/main/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md
滑动窗口最大值https://github.com/ovaldi/leetcode/blob/main/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md
满足不等式的最大值https://github.com/ovaldi/leetcode/blob/main/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md
和至少为 K 的最短子数组https://github.com/ovaldi/leetcode/blob/main/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md
带限制的子序列和https://github.com/ovaldi/leetcode/blob/main/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md
单词规律 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/0200-0299/0291.Word%20Pattern%20II/README.md
最短回文串https://github.com/ovaldi/leetcode/blob/main/solution/0200-0299/0214.Shortest%20Palindrome/README.md
回文对https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0336.Palindrome%20Pairs/README.md
最长重复子串https://github.com/ovaldi/leetcode/blob/main/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md
不同的循环子字符串https://github.com/ovaldi/leetcode/blob/main/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md
https://github.com/ovaldi/leetcode#3-搜索
图像渲染https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0733.Flood%20Fill/README.md
岛屿数量https://github.com/ovaldi/leetcode/blob/main/solution/0200-0299/0200.Number%20of%20Islands/README.md
01 矩阵https://github.com/ovaldi/leetcode/blob/main/solution/0500-0599/0542.01%20Matrix/README.md
地图中的最高点https://github.com/ovaldi/leetcode/blob/main/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md
进击的骑士https://github.com/ovaldi/leetcode/blob/main/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md
二进制矩阵中的最短路径https://github.com/ovaldi/leetcode/blob/main/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md
迷宫中离入口最近的出口https://github.com/ovaldi/leetcode/blob/main/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md
网格中的最短路径https://github.com/ovaldi/leetcode/blob/main/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md
打开转盘锁https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0752.Open%20the%20Lock/README.md
单词接龙https://github.com/ovaldi/leetcode/blob/main/solution/0100-0199/0127.Word%20Ladder/README.md
转化数字的最小运算数https://github.com/ovaldi/leetcode/blob/main/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md
滑动谜题https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0773.Sliding%20Puzzle/README.md
访问所有节点的最短路径https://github.com/ovaldi/leetcode/blob/main/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md
为高尔夫比赛砍树https://github.com/ovaldi/leetcode/blob/main/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md
使网格图至少有一条有效路径的最小代价https://github.com/ovaldi/leetcode/blob/main/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md
到达角落需要移除障碍物的最小数目https://github.com/ovaldi/leetcode/blob/main/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md
迷宫https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0490.The%20Maze/README.md
单词搜索https://github.com/ovaldi/leetcode/blob/main/solution/0000-0099/0079.Word%20Search/README.md
黄金矿工https://github.com/ovaldi/leetcode/blob/main/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md
火柴拼正方形https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md
划分为 k 个相等的子集https://github.com/ovaldi/leetcode/blob/main/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md
完成所有工作的最短时间https://github.com/ovaldi/leetcode/blob/main/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md
公平分发饼干https://github.com/ovaldi/leetcode/blob/main/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md
矩阵中的最长递增路径https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md
网格图中递增路径的数目https://github.com/ovaldi/leetcode/blob/main/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md
翻转游戏 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/0200-0299/0294.Flip%20Game%20II/README.md
统计所有可行路径https://github.com/ovaldi/leetcode/blob/main/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md
切披萨的方案数https://github.com/ovaldi/leetcode/blob/main/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md
https://github.com/ovaldi/leetcode#4-动态规划dp
杨辉三角https://github.com/ovaldi/leetcode/blob/main/solution/0100-0199/0118.Pascal's%20Triangle/README.md
最小路径和https://github.com/ovaldi/leetcode/blob/main/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md
摘樱桃https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0741.Cherry%20Pickup/README.md
摘樱桃 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md
最长递增子序列https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md
无重叠区间https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md
删列造序 IIIhttps://github.com/ovaldi/leetcode/blob/main/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md
俄罗斯套娃信封问题https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md
堆叠长方体的最大高度https://github.com/ovaldi/leetcode/blob/main/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md
无矛盾的最佳球队https://github.com/ovaldi/leetcode/blob/main/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md
最长公共子序列https://github.com/ovaldi/leetcode/blob/main/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md
两个字符串的最小 ASCII 删除和https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md
两个字符串的删除操作https://github.com/ovaldi/leetcode/blob/main/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md
目标和https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0494.Target%20Sum/README.md
分割等和子集https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md
最后一块石头的重量 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md
零钱兑换https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0322.Coin%20Change/README.md
组合总和 Ⅳhttps://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0377.Combination%20Sum%20IV/README.md
从栈中取出 K 个硬币的最大面值和https://github.com/ovaldi/leetcode/blob/main/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md
https://github.com/ovaldi/leetcode#5-高级数据结构
二维网格图中探测环https://github.com/ovaldi/leetcode/blob/main/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md
除法求值https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0399.Evaluate%20Division/README.md
由斜杠划分区域https://github.com/ovaldi/leetcode/blob/main/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md
水位上升的泳池中游泳https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md
交换字符串中的元素https://github.com/ovaldi/leetcode/blob/main/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md
打砖块https://github.com/ovaldi/leetcode/blob/main/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md
尽量减少恶意软件的传播 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md
检查边长度限制的路径是否存在https://github.com/ovaldi/leetcode/blob/main/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md
保证图可完全遍历https://github.com/ovaldi/leetcode/blob/main/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md
区域和检索 - 数组可修改https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md
通过指令创建有序数组https://github.com/ovaldi/leetcode/blob/main/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md
统计数组中好三元组数目https://github.com/ovaldi/leetcode/blob/main/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md
最多 K 次交换相邻数位后得到的最小整数https://github.com/ovaldi/leetcode/blob/main/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md
二维区域和检索 - 可变https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md
计算右侧小于当前元素的个数https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md
区间和的个数https://github.com/ovaldi/leetcode/blob/main/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md
翻转对https://github.com/ovaldi/leetcode/blob/main/solution/0400-0499/0493.Reverse%20Pairs/README.md
最长递增子序列的个数https://github.com/ovaldi/leetcode/blob/main/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md
奇妙序列https://github.com/ovaldi/leetcode/blob/main/solution/1600-1699/1622.Fancy%20Sequence/README.md
Range 模块https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0715.Range%20Module/README.md
我的日程安排表 IIIhttps://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0732.My%20Calendar%20III/README.md
每天绘制的新区域数量https://github.com/ovaldi/leetcode/blob/main/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md
由单个字符重复的最长子字符串https://github.com/ovaldi/leetcode/blob/main/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md
矩形面积 IIhttps://github.com/ovaldi/leetcode/blob/main/solution/0800-0899/0850.Rectangle%20Area%20II/README.md
https://github.com/ovaldi/leetcode#6-图论
网络延迟时间https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0743.Network%20Delay%20Time/README.md
得到要求路径的最小带权子图https://github.com/ovaldi/leetcode/blob/main/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md
连接所有点的最小费用https://github.com/ovaldi/leetcode/blob/main/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md
最低成本联通所有城市https://github.com/ovaldi/leetcode/blob/main/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md
水资源分配优化https://github.com/ovaldi/leetcode/blob/main/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md
找到最小生成树里的关键边和伪关键边https://github.com/ovaldi/leetcode/blob/main/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md
判断二分图https://github.com/ovaldi/leetcode/blob/main/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md
https://github.com/ovaldi/leetcode#加入我们
@kfstormhttps://github.com/kfstorm
C# 题解https://github.com/doocs/leetcode/pull/245
PRhttps://github.com/doocs/leetcode/pulls
https://help.github.com/cnhttps://help.github.com/cn
https://github.com/doocs/leetcode
Gitpod.iohttps://www.gitpod.io
https://gitpod.io/#https://github.com/doocs/leetcode
https://github.com/ovaldi/leetcode#stars-趋势
https://github.com/doocs/leetcode/stargazers
https://github.com/ovaldi/leetcode#贡献者
https://github.com/doocs/leetcode/graphs/contributors
https://github.com/ovaldi/leetcode#赞助者
https://opencollective.com/doocs-leetcode/backers.svg?width=890
https://opencollective.com/doocs-leetcode/sponsors.svg?width=890
Alan Yessenbayevhttps://opencollective.com/alan-yessenbayev
https://github.com/ovaldi/leetcode#推荐者
@爱可可-爱生活https://weibo.com/fly51fly
https://weibo.com/fly51fly
https://github.com/ovaldi/leetcode#许可证
知识共享 版权归属-相同方式共享 4.0 国际 公共许可证http://creativecommons.org/licenses/by-sa/4.0/
doocs.github.io/leetcodehttps://doocs.github.io/leetcode
Readme https://github.com/ovaldi/leetcode#readme-ov-file
CC-BY-SA-4.0 license https://github.com/ovaldi/leetcode#CC-BY-SA-4.0-1-ov-file
Code of conduct https://github.com/ovaldi/leetcode#coc-ov-file
Please reload this pagehttps://github.com/ovaldi/leetcode
Activityhttps://github.com/ovaldi/leetcode/activity
0 forkshttps://github.com/ovaldi/leetcode/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fovaldi%2Fleetcode&report=ovaldi+%28user%29
Releaseshttps://github.com/ovaldi/leetcode/releases
Packages 0https://github.com/users/ovaldi/packages?repo_name=leetcode
Please reload this pagehttps://github.com/ovaldi/leetcode
Contributorshttps://github.com/ovaldi/leetcode/graphs/contributors
Please reload this pagehttps://github.com/ovaldi/leetcode
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.