René's URL Explorer Experiment


Title: leetcode2/solution at main · gitbruce/leetcode2 · GitHub

Open Graph Title: leetcode2/solution at main · gitbruce/leetcode2

X Title: leetcode2/solution at main · gitbruce/leetcode2

Description: 🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer(第 2 版)》、《程序员面试金典(第 6 版)》题解 - leetcode2/solution at main · gitbruce/leetcode2

Open Graph Description: 🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer(第 2 版)》、《程序员面试金典(第 6 版)》题解 - gitbruce/leetcode2

X Description: 🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer(第 2 版)》、《程序员面试金典(第 6 版)》题解 - gitbruce/leetcode2

Opengraph URL: https://github.com/gitbruce/leetcode2/tree/main/solution

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository/tree/*name(/*path)
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:a57dd042-5c3e-a88d-48b9-620b7b4e1c42
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idCC12:232CA8:65A4B1:86DE0C:6A598652
html-safe-nonce9682afaeaec9e5632aee2a8f760bc70f8035b806da3515d77dcd6bf19ba5dcc0
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDQzEyOjIzMkNBODo2NUE0QjE6ODZERTBDOjZBNTk4NjUyIiwidmlzaXRvcl9pZCI6Ijk3MDY2NTE2MDc2OTIyNDUwIiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmace3eb599d622bd20014bc259a0fdb2c9ee575a4a3ef457955ad96daf7a7c743e2
hovercard-subject-tagrepository:762762895
github-keyboard-shortcutsrepository,source-code,file-tree,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location///files/disambiguate
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/gitbruce/leetcode2/tree/main/solution
twitter:imagehttps://opengraph.githubassets.com/1edd7bb43217c2a3df5ca0d95c694b54189c36eeeed0c126b0f3bd71b3ecb7d9/gitbruce/leetcode2
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/1edd7bb43217c2a3df5ca0d95c694b54189c36eeeed0c126b0f3bd71b3ecb7d9/gitbruce/leetcode2
og:image:alt🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer(第 2 版)》、《程序员面试金典(第 6 版)》题解 - gitbruce/leetcode2
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Nonea540949572872b935b393b36db38922db390ae71c859537d741b8f3eb7e545b5
turbo-cache-controlno-cache
go-importgithub.com/gitbruce/leetcode2 git https://github.com/gitbruce/leetcode2.git
octolytics-dimension-user_id3782359
octolytics-dimension-user_logingitbruce
octolytics-dimension-repository_id762762895
octolytics-dimension-repository_nwogitbruce/leetcode2
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/gitbruce/leetcode2/tree/main/solution#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fgitbruce%2Fleetcode2%2Ftree%2Fmain%2Fsolution
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%2Fgitbruce%2Fleetcode2%2Ftree%2Fmain%2Fsolution
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%2Ffiles%2Fdisambiguate&source=header-repo&source_repo=gitbruce%2Fleetcode2
Reloadhttps://github.com/gitbruce/leetcode2/tree/main/solution
Reloadhttps://github.com/gitbruce/leetcode2/tree/main/solution
Reloadhttps://github.com/gitbruce/leetcode2/tree/main/solution
gitbruce https://github.com/gitbruce
leetcode2https://github.com/gitbruce/leetcode2
doocs/leetcodehttps://github.com/doocs/leetcode
Notifications https://github.com/login?return_to=%2Fgitbruce%2Fleetcode2
Fork 0 https://github.com/login?return_to=%2Fgitbruce%2Fleetcode2
Star 0 https://github.com/login?return_to=%2Fgitbruce%2Fleetcode2
Code https://github.com/gitbruce/leetcode2
Pull requests 0 https://github.com/gitbruce/leetcode2/pulls
Actions https://github.com/gitbruce/leetcode2/actions
Projects https://github.com/gitbruce/leetcode2/projects
Security and quality 0 https://github.com/gitbruce/leetcode2/security
Insights https://github.com/gitbruce/leetcode2/pulse
Code https://github.com/gitbruce/leetcode2
Pull requests https://github.com/gitbruce/leetcode2/pulls
Actions https://github.com/gitbruce/leetcode2/actions
Projects https://github.com/gitbruce/leetcode2/projects
Security and quality https://github.com/gitbruce/leetcode2/security
Insights https://github.com/gitbruce/leetcode2/pulse
https://github.com/gitbruce/leetcode2
leetcode2https://github.com/gitbruce/leetcode2/tree/main
Historyhttps://github.com/gitbruce/leetcode2/commits/main/solution
https://github.com/gitbruce/leetcode2/commits/main/solution
leetcode2https://github.com/gitbruce/leetcode2/tree/main
..https://github.com/gitbruce/leetcode2/tree/main
0000-0099https://github.com/gitbruce/leetcode2/tree/main/solution/0000-0099
0000-0099https://github.com/gitbruce/leetcode2/tree/main/solution/0000-0099
0100-0199https://github.com/gitbruce/leetcode2/tree/main/solution/0100-0199
0100-0199https://github.com/gitbruce/leetcode2/tree/main/solution/0100-0199
0200-0299https://github.com/gitbruce/leetcode2/tree/main/solution/0200-0299
0200-0299https://github.com/gitbruce/leetcode2/tree/main/solution/0200-0299
0300-0399https://github.com/gitbruce/leetcode2/tree/main/solution/0300-0399
0300-0399https://github.com/gitbruce/leetcode2/tree/main/solution/0300-0399
0400-0499https://github.com/gitbruce/leetcode2/tree/main/solution/0400-0499
0400-0499https://github.com/gitbruce/leetcode2/tree/main/solution/0400-0499
0500-0599https://github.com/gitbruce/leetcode2/tree/main/solution/0500-0599
0500-0599https://github.com/gitbruce/leetcode2/tree/main/solution/0500-0599
0600-0699https://github.com/gitbruce/leetcode2/tree/main/solution/0600-0699
0600-0699https://github.com/gitbruce/leetcode2/tree/main/solution/0600-0699
0700-0799https://github.com/gitbruce/leetcode2/tree/main/solution/0700-0799
0700-0799https://github.com/gitbruce/leetcode2/tree/main/solution/0700-0799
0800-0899https://github.com/gitbruce/leetcode2/tree/main/solution/0800-0899
0800-0899https://github.com/gitbruce/leetcode2/tree/main/solution/0800-0899
0900-0999https://github.com/gitbruce/leetcode2/tree/main/solution/0900-0999
0900-0999https://github.com/gitbruce/leetcode2/tree/main/solution/0900-0999
1000-1099https://github.com/gitbruce/leetcode2/tree/main/solution/1000-1099
1000-1099https://github.com/gitbruce/leetcode2/tree/main/solution/1000-1099
1100-1199https://github.com/gitbruce/leetcode2/tree/main/solution/1100-1199
1100-1199https://github.com/gitbruce/leetcode2/tree/main/solution/1100-1199
1200-1299https://github.com/gitbruce/leetcode2/tree/main/solution/1200-1299
1200-1299https://github.com/gitbruce/leetcode2/tree/main/solution/1200-1299
1300-1399https://github.com/gitbruce/leetcode2/tree/main/solution/1300-1399
1300-1399https://github.com/gitbruce/leetcode2/tree/main/solution/1300-1399
1400-1499https://github.com/gitbruce/leetcode2/tree/main/solution/1400-1499
1400-1499https://github.com/gitbruce/leetcode2/tree/main/solution/1400-1499
1500-1599https://github.com/gitbruce/leetcode2/tree/main/solution/1500-1599
1500-1599https://github.com/gitbruce/leetcode2/tree/main/solution/1500-1599
1600-1699https://github.com/gitbruce/leetcode2/tree/main/solution/1600-1699
1600-1699https://github.com/gitbruce/leetcode2/tree/main/solution/1600-1699
1700-1799https://github.com/gitbruce/leetcode2/tree/main/solution/1700-1799
1700-1799https://github.com/gitbruce/leetcode2/tree/main/solution/1700-1799
1800-1899https://github.com/gitbruce/leetcode2/tree/main/solution/1800-1899
1800-1899https://github.com/gitbruce/leetcode2/tree/main/solution/1800-1899
1900-1999https://github.com/gitbruce/leetcode2/tree/main/solution/1900-1999
1900-1999https://github.com/gitbruce/leetcode2/tree/main/solution/1900-1999
2000-2099https://github.com/gitbruce/leetcode2/tree/main/solution/2000-2099
2000-2099https://github.com/gitbruce/leetcode2/tree/main/solution/2000-2099
2100-2199https://github.com/gitbruce/leetcode2/tree/main/solution/2100-2199
2100-2199https://github.com/gitbruce/leetcode2/tree/main/solution/2100-2199
2200-2299https://github.com/gitbruce/leetcode2/tree/main/solution/2200-2299
2200-2299https://github.com/gitbruce/leetcode2/tree/main/solution/2200-2299
2300-2399https://github.com/gitbruce/leetcode2/tree/main/solution/2300-2399
2300-2399https://github.com/gitbruce/leetcode2/tree/main/solution/2300-2399
2400-2499https://github.com/gitbruce/leetcode2/tree/main/solution/2400-2499
2400-2499https://github.com/gitbruce/leetcode2/tree/main/solution/2400-2499
2500-2599https://github.com/gitbruce/leetcode2/tree/main/solution/2500-2599
2500-2599https://github.com/gitbruce/leetcode2/tree/main/solution/2500-2599
2600-2699https://github.com/gitbruce/leetcode2/tree/main/solution/2600-2699
2600-2699https://github.com/gitbruce/leetcode2/tree/main/solution/2600-2699
2700-2799https://github.com/gitbruce/leetcode2/tree/main/solution/2700-2799
2700-2799https://github.com/gitbruce/leetcode2/tree/main/solution/2700-2799
2800-2899https://github.com/gitbruce/leetcode2/tree/main/solution/2800-2899
2800-2899https://github.com/gitbruce/leetcode2/tree/main/solution/2800-2899
2900-2999https://github.com/gitbruce/leetcode2/tree/main/solution/2900-2999
2900-2999https://github.com/gitbruce/leetcode2/tree/main/solution/2900-2999
3000-3099https://github.com/gitbruce/leetcode2/tree/main/solution/3000-3099
3000-3099https://github.com/gitbruce/leetcode2/tree/main/solution/3000-3099
CONTEST_README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/CONTEST_README.md
CONTEST_README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/CONTEST_README.md
CONTEST_README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/CONTEST_README_EN.md
CONTEST_README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/CONTEST_README_EN.md
DATABASE_README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/DATABASE_README.md
DATABASE_README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/DATABASE_README.md
DATABASE_README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/DATABASE_README_EN.md
DATABASE_README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/DATABASE_README_EN.md
JAVASCRIPT_README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/JAVASCRIPT_README.md
JAVASCRIPT_README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/JAVASCRIPT_README.md
JAVASCRIPT_README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/JAVASCRIPT_README_EN.md
JAVASCRIPT_README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/JAVASCRIPT_README_EN.md
README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/README.md
README.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/README.md
README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/README_EN.md
README_EN.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/README_EN.md
__init__.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/__init__.py
__init__.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/__init__.py
database-summary.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/database-summary.md
database-summary.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/database-summary.md
database-summary_en.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/database-summary_en.md
database-summary_en.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/database-summary_en.md
javascript-summary.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/javascript-summary.md
javascript-summary.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/javascript-summary.md
javascript-summary_en.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/javascript-summary_en.md
javascript-summary_en.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/javascript-summary_en.md
main.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/main.py
main.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/main.py
rating.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/rating.py
rating.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/rating.py
template.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/template.md
template.mdhttps://github.com/gitbruce/leetcode2/blob/main/solution/template.md
util.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/util.py
util.pyhttps://github.com/gitbruce/leetcode2/blob/main/solution/util.py
README.mdhttps://github.com/gitbruce/leetcode2/tree/main/solution#readme
https://github.com/gitbruce/leetcode2/tree/main/solution#leetcode
English Versionhttps://github.com/gitbruce/leetcode2/blob/main/solution/README_EN.md
https://github.com/gitbruce/leetcode2/tree/main/solution#题解
开源社区 Doocshttps://github.com/doocs
两数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0001.Two%20Sum/README.md
两数相加https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0002.Add%20Two%20Numbers/README.md
无重复字符的最长子串https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md
寻找两个正序数组的中位数https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md
最长回文子串https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md
Z 字形变换https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0006.Zigzag%20Conversion/README.md
整数反转https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0007.Reverse%20Integer/README.md
字符串转换整数 (atoi)https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md
回文数https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0009.Palindrome%20Number/README.md
正则表达式匹配https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md
盛最多水的容器https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md
整数转罗马数字https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0012.Integer%20to%20Roman/README.md
罗马数字转整数https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0013.Roman%20to%20Integer/README.md
最长公共前缀https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md
三数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0015.3Sum/README.md
最接近的三数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0016.3Sum%20Closest/README.md
电话号码的字母组合https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md
四数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0018.4Sum/README.md
删除链表的倒数第 N 个结点https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md
有效的括号https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0020.Valid%20Parentheses/README.md
合并两个有序链表https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md
括号生成https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0022.Generate%20Parentheses/README.md
合并 K 个升序链表https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md
两两交换链表中的节点https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md
K 个一组翻转链表https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md
删除有序数组中的重复项https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md
移除元素https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0027.Remove%20Element/README.md
找出字符串中第一个匹配项的下标https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README.md
两数相除https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0029.Divide%20Two%20Integers/README.md
串联所有单词的子串https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md
下一个排列https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0031.Next%20Permutation/README.md
最长有效括号https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md
搜索旋转排序数组https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md
在排序数组中查找元素的第一个和最后一个位置https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md
搜索插入位置https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0035.Search%20Insert%20Position/README.md
有效的数独https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0036.Valid%20Sudoku/README.md
解数独https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0037.Sudoku%20Solver/README.md
外观数列https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0038.Count%20and%20Say/README.md
组合总和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0039.Combination%20Sum/README.md
组合总和 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README.md
缺失的第一个正数https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0041.First%20Missing%20Positive/README.md
接雨水https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md
字符串相乘https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0043.Multiply%20Strings/README.md
通配符匹配https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0044.Wildcard%20Matching/README.md
跳跃游戏 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README.md
全排列https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0046.Permutations/README.md
全排列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0047.Permutations%20II/README.md
旋转图像https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0048.Rotate%20Image/README.md
字母异位词分组https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0049.Group%20Anagrams/README.md
Pow(x, n)https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md
N 皇后https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0051.N-Queens/README.md
N 皇后 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0052.N-Queens%20II/README.md
最大子数组和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0053.Maximum%20Subarray/README.md
螺旋矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0054.Spiral%20Matrix/README.md
跳跃游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0055.Jump%20Game/README.md
合并区间https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0056.Merge%20Intervals/README.md
插入区间https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0057.Insert%20Interval/README.md
最后一个单词的长度https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md
螺旋矩阵 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md
排列序列https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0060.Permutation%20Sequence/README.md
旋转链表https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0061.Rotate%20List/README.md
不同路径https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0062.Unique%20Paths/README.md
不同路径 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0063.Unique%20Paths%20II/README.md
最小路径和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md
有效数字https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0065.Valid%20Number/README.md
加一https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0066.Plus%20One/README.md
二进制求和https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0067.Add%20Binary/README.md
文本左右对齐https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0068.Text%20Justification/README.md
x 的平方根 https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0069.Sqrt%28x%29/README.md
爬楼梯https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0070.Climbing%20Stairs/README.md
简化路径https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0071.Simplify%20Path/README.md
编辑距离https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0072.Edit%20Distance/README.md
矩阵置零https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md
搜索二维矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md
颜色分类https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0075.Sort%20Colors/README.md
最小覆盖子串https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md
组合https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0077.Combinations/README.md
子集https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0078.Subsets/README.md
单词搜索https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0079.Word%20Search/README.md
删除有序数组中的重复项 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md
搜索旋转排序数组 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md
删除排序链表中的重复元素 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md
删除排序链表中的重复元素https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md
柱状图中最大的矩形https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md
最大矩形https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0085.Maximal%20Rectangle/README.md
分隔链表https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0086.Partition%20List/README.md
扰乱字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0087.Scramble%20String/README.md
合并两个有序数组https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md
格雷编码https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0089.Gray%20Code/README.md
子集 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0090.Subsets%20II/README.md
解码方法https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0091.Decode%20Ways/README.md
反转链表 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md
复原 IP 地址https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md
二叉树的中序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md
不同的二叉搜索树 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md
不同的二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md
交错字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0097.Interleaving%20String/README.md
验证二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md
恢复二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md
相同的树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0100.Same%20Tree/README.md
对称二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0101.Symmetric%20Tree/README.md
二叉树的层序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md
二叉树的锯齿形层序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md
二叉树的最大深度https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md
从前序与中序遍历序列构造二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md
从中序与后序遍历序列构造二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md
二叉树的层序遍历 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md
将有序数组转换为二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md
有序链表转换二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md
平衡二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md
二叉树的最小深度https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md
路径总和https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0112.Path%20Sum/README.md
路径总和 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0113.Path%20Sum%20II/README.md
二叉树展开为链表https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md
不同的子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0115.Distinct%20Subsequences/README.md
填充每个节点的下一个右侧节点指针https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md
填充每个节点的下一个右侧节点指针 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md
杨辉三角https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md
杨辉三角 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md
三角形最小路径和https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0120.Triangle/README.md
买卖股票的最佳时机https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md
买卖股票的最佳时机 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md
买卖股票的最佳时机 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md
二叉树中的最大路径和https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md
验证回文串https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0125.Valid%20Palindrome/README.md
单词接龙 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0126.Word%20Ladder%20II/README.md
单词接龙https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0127.Word%20Ladder/README.md
最长连续序列https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md
求根节点到叶节点数字之和https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md
被围绕的区域https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0130.Surrounded%20Regions/README.md
分割回文串https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0131.Palindrome%20Partitioning/README.md
分割回文串 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md
克隆图https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0133.Clone%20Graph/README.md
加油站https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0134.Gas%20Station/README.md
分发糖果https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0135.Candy/README.md
只出现一次的数字https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0136.Single%20Number/README.md
只出现一次的数字 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0137.Single%20Number%20II/README.md
随机链表的复制https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md
单词拆分https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0139.Word%20Break/README.md
单词拆分 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0140.Word%20Break%20II/README.md
环形链表https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0141.Linked%20List%20Cycle/README.md
环形链表 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md
重排链表https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0143.Reorder%20List/README.md
二叉树的前序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md
二叉树的后序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md
LRU 缓存https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0146.LRU%20Cache/README.md
对链表进行插入排序https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0147.Insertion%20Sort%20List/README.md
排序链表https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0148.Sort%20List/README.md
直线上最多的点数https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md
逆波兰表达式求值https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md
反转字符串中的单词https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md
乘积最大子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md
寻找旋转排序数组中的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md
寻找旋转排序数组中的最小值 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md
最小栈https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0155.Min%20Stack/README.md
上下翻转二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md
用 Read4 读取 N 个字符https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md
用 Read4 读取 N 个字符 II - 多次调用https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README.md
至多包含两个不同字符的最长子串https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md
相交链表https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md
相隔为 1 的编辑距离https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0161.One%20Edit%20Distance/README.md
寻找峰值https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0162.Find%20Peak%20Element/README.md
缺失的区间https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0163.Missing%20Ranges/README.md
最大间距https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0164.Maximum%20Gap/README.md
比较版本号https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md
分数到小数https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md
两数之和 II - 输入有序数组https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README.md
Excel表列名称https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md
多数元素https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0169.Majority%20Element/README.md
两数之和 III - 数据结构设计https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md
Excel 表列序号https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md
阶乘后的零https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md
二叉搜索树迭代器https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md
地下城游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0174.Dungeon%20Game/README.md
组合两个表https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0175.Combine%20Two%20Tables/README.md
第二高的薪水https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0176.Second%20Highest%20Salary/README.md
第N高的薪水https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md
分数排名https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0178.Rank%20Scores/README.md
最大数https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0179.Largest%20Number/README.md
连续出现的数字https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0180.Consecutive%20Numbers/README.md
超过经理收入的员工https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md
查找重复的电子邮箱https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0182.Duplicate%20Emails/README.md
从不订购的客户https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md
部门工资最高的员工https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0184.Department%20Highest%20Salary/README.md
部门工资前三高的所有员工https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md
反转字符串中的单词 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md
重复的DNA序列https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md
买卖股票的最佳时机 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md
轮转数组https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0189.Rotate%20Array/README.md
颠倒二进制位https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0190.Reverse%20Bits/README.md
位1的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0191.Number%20of%201%20Bits/README.md
统计词频https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0192.Word%20Frequency/README.md
有效电话号码https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md
转置文件https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0194.Transpose%20File/README.md
第十行https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0195.Tenth%20Line/README.md
删除重复的电子邮箱https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md
上升的温度https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0197.Rising%20Temperature/README.md
打家劫舍https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0198.House%20Robber/README.md
二叉树的右视图https://github.com/gitbruce/leetcode2/blob/main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md
岛屿数量https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0200.Number%20of%20Islands/README.md
数字范围按位与https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md
快乐数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0202.Happy%20Number/README.md
移除链表元素https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md
计数质数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0204.Count%20Primes/README.md
同构字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0205.Isomorphic%20Strings/README.md
反转链表https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0206.Reverse%20Linked%20List/README.md
课程表https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0207.Course%20Schedule/README.md
实现 Trie (前缀树)https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md
长度最小的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md
课程表 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0210.Course%20Schedule%20II/README.md
添加与搜索单词 - 数据结构设计https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md
单词搜索 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0212.Word%20Search%20II/README.md
打家劫舍 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0213.House%20Robber%20II/README.md
最短回文串https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0214.Shortest%20Palindrome/README.md
数组中的第K个最大元素https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md
组合总和 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0216.Combination%20Sum%20III/README.md
存在重复元素https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0217.Contains%20Duplicate/README.md
天际线问题https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0218.The%20Skyline%20Problem/README.md
存在重复元素 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md
存在重复元素 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md
最大正方形https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0221.Maximal%20Square/README.md
完全二叉树的节点个数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md
矩形面积https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0223.Rectangle%20Area/README.md
基本计算器https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0224.Basic%20Calculator/README.md
用队列实现栈https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md
翻转二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md
基本计算器 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0227.Basic%20Calculator%20II/README.md
汇总区间https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0228.Summary%20Ranges/README.md
多数元素 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0229.Majority%20Element%20II/README.md
二叉搜索树中第K小的元素https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md
2 的幂https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0231.Power%20of%20Two/README.md
用栈实现队列https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md
数字 1 的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md
回文链表https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md
二叉搜索树的最近公共祖先https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md
二叉树的最近公共祖先https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md
删除链表中的节点https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md
除自身以外数组的乘积https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md
滑动窗口最大值https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md
搜索二维矩阵 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md
为运算表达式设计优先级https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md
有效的字母异位词https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0242.Valid%20Anagram/README.md
最短单词距离https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md
最短单词距离 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md
最短单词距离 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md
中心对称数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0246.Strobogrammatic%20Number/README.md
中心对称数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md
中心对称数 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md
移位字符串分组https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md
统计同值子树https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md
展开二维向量https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0251.Flatten%202D%20Vector/README.md
会议室https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0252.Meeting%20Rooms/README.md
会议室 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md
因子的组合https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0254.Factor%20Combinations/README.md
验证二叉搜索树的前序遍历序列https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md
粉刷房子https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0256.Paint%20House/README.md
二叉树的所有路径https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md
各位相加https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0258.Add%20Digits/README.md
较小的三数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0259.3Sum%20Smaller/README.md
只出现一次的数字 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0260.Single%20Number%20III/README.md
以图判树https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md
行程和用户https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0262.Trips%20and%20Users/README.md
丑数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0263.Ugly%20Number/README.md
丑数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0264.Ugly%20Number%20II/README.md
粉刷房子 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0265.Paint%20House%20II/README.md
回文排列https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0266.Palindrome%20Permutation/README.md
回文排列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md
丢失的数字https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0268.Missing%20Number/README.md
火星词典https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0269.Alien%20Dictionary/README.md
最接近的二叉搜索树值https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md
字符串的编码与解码https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md
最接近的二叉搜索树值 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md
整数转换英文表示https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md
H 指数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0274.H-Index/README.md
H 指数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0275.H-Index%20II/README.md
栅栏涂色https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0276.Paint%20Fence/README.md
搜寻名人https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0277.Find%20the%20Celebrity/README.md
第一个错误的版本https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0278.First%20Bad%20Version/README.md
完全平方数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0279.Perfect%20Squares/README.md
摆动排序https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0280.Wiggle%20Sort/README.md
锯齿迭代器https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0281.Zigzag%20Iterator/README.md
给表达式添加运算符https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0282.Expression%20Add%20Operators/README.md
移动零https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0283.Move%20Zeroes/README.md
窥视迭代器https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0284.Peeking%20Iterator/README.md
二叉搜索树中的中序后继https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md
墙与门https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0286.Walls%20and%20Gates/README.md
寻找重复数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md
单词的唯一缩写https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md
生命游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0289.Game%20of%20Life/README.md
单词规律https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0290.Word%20Pattern/README.md
单词规律 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0291.Word%20Pattern%20II/README.md
Nim 游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0292.Nim%20Game/README.md
翻转游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0293.Flip%20Game/README.md
翻转游戏 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0294.Flip%20Game%20II/README.md
数据流的中位数https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md
最佳的碰头地点https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0296.Best%20Meeting%20Point/README.md
二叉树的序列化与反序列化https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md
二叉树最长连续序列https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md
猜数字游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0200-0299/0299.Bulls%20and%20Cows/README.md
最长递增子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md
删除无效的括号https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md
包含全部黑色像素的最小矩形https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md
区域和检索 - 数组不可变https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md
二维区域和检索 - 矩阵不可变https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md
岛屿数量 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md
累加数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0306.Additive%20Number/README.md
区域和检索 - 数组可修改https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md
二维区域和检索 - 可变https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md
买卖股票的最佳时机含冷冻期https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md
最小高度树https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md
稀疏矩阵的乘法https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md
戳气球https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0312.Burst%20Balloons/README.md
超级丑数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0313.Super%20Ugly%20Number/README.md
二叉树的垂直遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md
计算右侧小于当前元素的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md
去除重复字母https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md
离建筑物最近的距离https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md
最大单词长度乘积https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md
灯泡开关https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0319.Bulb%20Switcher/README.md
列举单词的全部缩写https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0320.Generalized%20Abbreviation/README.md
拼接最大数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0321.Create%20Maximum%20Number/README.md
零钱兑换https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0322.Coin%20Change/README.md
无向图中连通分量的数目https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md
摆动排序 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md
和等于 k 的最长子数组长度https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md
3 的幂https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0326.Power%20of%20Three/README.md
区间和的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md
奇偶链表https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md
矩阵中的最长递增路径https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md
按要求补齐数组https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0330.Patching%20Array/README.md
验证二叉树的前序序列化https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md
重新安排行程https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md
最大二叉搜索子树https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md
递增的三元子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md
路径交叉https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0335.Self%20Crossing/README.md
回文对https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0336.Palindrome%20Pairs/README.md
打家劫舍 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0337.House%20Robber%20III/README.md
比特位计数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0338.Counting%20Bits/README.md
嵌套列表加权和https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md
至多包含 K 个不同字符的最长子串https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md
扁平化嵌套列表迭代器https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md
4的幂https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0342.Power%20of%20Four/README.md
整数拆分https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0343.Integer%20Break/README.md
反转字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0344.Reverse%20String/README.md
反转字符串中的元音字母https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md
数据流中的移动平均值https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md
前 K 个高频元素https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md
设计井字棋https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md
两个数组的交集https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md
两个数组的交集 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md
安卓系统手势解锁https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md
将数据流变为多个不相交区间https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md
贪吃蛇https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0353.Design%20Snake%20Game/README.md
俄罗斯套娃信封问题https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md
设计推特https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0355.Design%20Twitter/README.md
直线镜像https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0356.Line%20Reflection/README.md
统计各位数字都不同的数字个数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md
K 距离间隔重排字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md
日志速率限制器https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md
有序转化数组https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md
轰炸敌人https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0361.Bomb%20Enemy/README.md
敲击计数器https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0362.Design%20Hit%20Counter/README.md
矩形区域不超过 K 的最大数值和https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md
嵌套列表加权和 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md
水壶问题https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md
寻找二叉树的叶子节点https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md
有效的完全平方数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md
最大整除子集https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md
给单链表加一https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md
区间加法https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0370.Range%20Addition/README.md
两整数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md
超级次方https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0372.Super%20Pow/README.md
查找和最小的 K 对数字https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md
猜数字大小https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md
猜数字大小 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md
摆动序列https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0376.Wiggle%20Subsequence/README.md
组合总和 Ⅳhttps://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0377.Combination%20Sum%20IV/README.md
有序矩阵中第 K 小的元素https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md
电话目录管理系统https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0379.Design%20Phone%20Directory/README.md
O(1) 时间插入、删除和获取随机元素https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md
O(1) 时间插入、删除和获取随机元素 - 允许重复https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md
链表随机节点https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md
赎金信https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0383.Ransom%20Note/README.md
打乱数组https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0384.Shuffle%20an%20Array/README.md
迷你语法分析器https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0385.Mini%20Parser/README.md
字典序排数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0386.Lexicographical%20Numbers/README.md
字符串中的第一个唯一字符https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md
文件的最长绝对路径https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md
找不同https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0389.Find%20the%20Difference/README.md
消除游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0390.Elimination%20Game/README.md
完美矩形https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0391.Perfect%20Rectangle/README.md
判断子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0392.Is%20Subsequence/README.md
UTF-8 编码验证https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0393.UTF-8%20Validation/README.md
字符串解码https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0394.Decode%20String/README.md
至少有 K 个重复字符的最长子串https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md
旋转函数https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0396.Rotate%20Function/README.md
整数替换https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0397.Integer%20Replacement/README.md
随机数索引https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0398.Random%20Pick%20Index/README.md
除法求值https://github.com/gitbruce/leetcode2/blob/main/solution/0300-0399/0399.Evaluate%20Division/README.md
第 N 位数字https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0400.Nth%20Digit/README.md
二进制手表https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0401.Binary%20Watch/README.md
移掉 K 位数字https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0402.Remove%20K%20Digits/README.md
青蛙过河https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0403.Frog%20Jump/README.md
左叶子之和https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md
数字转换为十六进制数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md
根据身高重建队列https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md
接雨水 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md
有效单词缩写https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md
最长回文串https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0409.Longest%20Palindrome/README.md
分割数组的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md
最短独占单词缩写https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md
Fizz Buzzhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0412.Fizz%20Buzz/README.md
等差数列划分https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0413.Arithmetic%20Slices/README.md
第三大的数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0414.Third%20Maximum%20Number/README.md
字符串相加https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0415.Add%20Strings/README.md
分割等和子集https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md
太平洋大西洋水流问题https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md
屏幕可显示句子的数量https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md
甲板上的战舰https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md
强密码检验器https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0420.Strong%20Password%20Checker/README.md
数组中两个数的最大异或值https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md
有效的单词方块https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0422.Valid%20Word%20Square/README.md
从英文中重建数字https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md
替换后的最长重复字符https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md
单词方块https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0425.Word%20Squares/README.md
将二叉搜索树转化为排序的双向链表https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md
建立四叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md
序列化和反序列化 N 叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md
N 叉树的层序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md
扁平化多级双向链表https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md
将 N 叉树编码为二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md
全 O(1) 的数据结构https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README.md
最小基因变化https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md
字符串中的单词数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md
无重叠区间https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md
寻找右区间https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0436.Find%20Right%20Interval/README.md
路径总和 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0437.Path%20Sum%20III/README.md
找到字符串中所有字母异位词https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md
三元表达式解析器https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md
字典序的第K小数字https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md
排列硬币https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0441.Arranging%20Coins/README.md
数组中重复的数据https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md
压缩字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0443.String%20Compression/README.md
序列重建https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0444.Sequence%20Reconstruction/README.md
两数相加 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md
等差数列划分 II - 子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md
回旋镖的数量https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md
找到所有数组中消失的数字https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md
序列化和反序列化二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md
删除二叉搜索树中的节点https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md
根据字符出现频率排序https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md
用最少数量的箭引爆气球https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md
最小操作次数使数组元素相等https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md
四数相加 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0454.4Sum%20II/README.md
分发饼干https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0455.Assign%20Cookies/README.md
132 模式https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0456.132%20Pattern/README.md
环形数组是否存在循环https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0457.Circular%20Array%20Loop/README.md
可怜的小猪https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0458.Poor%20Pigs/README.md
重复的子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md
LFU 缓存https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0460.LFU%20Cache/README.md
汉明距离https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0461.Hamming%20Distance/README.md
最小操作次数使数组元素相等 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md
岛屿的周长https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0463.Island%20Perimeter/README.md
我能赢吗https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0464.Can%20I%20Win/README.md
最优账单平衡https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md
统计重复个数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0466.Count%20The%20Repetitions/README.md
环绕字符串中唯一的子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md
验证IP地址https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0468.Validate%20IP%20Address/README.md
凸多边形https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0469.Convex%20Polygon/README.md
用 Rand7() 实现 Rand10()https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md
编码最短长度的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md
连接词https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0472.Concatenated%20Words/README.md
火柴拼正方形https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md
一和零https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md
供暖器https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0475.Heaters/README.md
数字的补数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0476.Number%20Complement/README.md
汉明距离总和https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md
在圆内随机生成点https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md
最大回文数乘积https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md
滑动窗口中位数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0480.Sliding%20Window%20Median/README.md
神奇字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0481.Magical%20String/README.md
密钥格式化https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0482.License%20Key%20Formatting/README.md
最小好进制https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0483.Smallest%20Good%20Base/README.md
寻找排列https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0484.Find%20Permutation/README.md
最大连续 1 的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md
预测赢家https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0486.Predict%20the%20Winner/README.md
最大连续1的个数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md
祖玛游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0488.Zuma%20Game/README.md
扫地机器人https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md
迷宫https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0490.The%20Maze/README.md
非递减子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0491.Non-decreasing%20Subsequences/README.md
构造矩形https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md
翻转对https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0493.Reverse%20Pairs/README.md
目标和https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0494.Target%20Sum/README.md
提莫攻击https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0495.Teemo%20Attacking/README.md
下一个更大元素 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md
非重叠矩形中的随机点https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md
对角线遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0498.Diagonal%20Traverse/README.md
迷宫 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0400-0499/0499.The%20Maze%20III/README.md
键盘行https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0500.Keyboard%20Row/README.md
二叉搜索树中的众数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md
IPOhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0502.IPO/README.md
下一个更大元素 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md
七进制数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0504.Base%207/README.md
迷宫 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0505.The%20Maze%20II/README.md
相对名次https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0506.Relative%20Ranks/README.md
完美数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0507.Perfect%20Number/README.md
出现次数最多的子树元素和https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md
斐波那契数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0509.Fibonacci%20Number/README.md
二叉搜索树中的中序后继 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md
游戏玩法分析 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md
游戏玩法分析 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md
找树左下角的值https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md
自由之路https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0514.Freedom%20Trail/README.md
在每个树行中找最大值https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md
最长回文子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md
超级洗衣机https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0517.Super%20Washing%20Machines/README.md
零钱兑换 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0518.Coin%20Change%20II/README.md
随机翻转矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md
检测大写字母https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0520.Detect%20Capital/README.md
最长特殊序列 Ⅰhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md
最长特殊序列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md
连续的子数组和https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md
通过删除字母匹配到字典里最长单词https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md
连续数组https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0525.Contiguous%20Array/README.md
优美的排列https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0526.Beautiful%20Arrangement/README.md
单词缩写https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0527.Word%20Abbreviation/README.md
按权重随机选择https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md
扫雷游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0529.Minesweeper/README.md
二叉搜索树的最小绝对差https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md
孤独像素 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md
数组中的 k-diff 数对https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md
孤独像素 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md
游戏玩法分析 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md
TinyURL 的加密与解密https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md
从字符串生成二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md
复数乘法https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md
把二叉搜索树转换为累加树https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md
最小时间差https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md
有序数组中的单一元素https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md
反转字符串 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0541.Reverse%20String%20II/README.md
01 矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0542.01%20Matrix/README.md
二叉树的直径https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md
输出比赛匹配对https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0544.Output%20Contest%20Matches/README.md
二叉树的边界https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md
移除盒子https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0546.Remove%20Boxes/README.md
省份数量https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0547.Number%20of%20Provinces/README.md
将数组分割成和相等的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md
二叉树最长连续序列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md
游戏玩法分析 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md
学生出勤记录 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md
学生出勤记录 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md
最优除法https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0553.Optimal%20Division/README.md
砖墙https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0554.Brick%20Wall/README.md
分割连接字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md
下一个更大元素 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md
反转字符串中的单词 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md
四叉树交集https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md
N 叉树的最大深度https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md
和为 K 的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md
数组拆分https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0561.Array%20Partition/README.md
矩阵中最长的连续1线段https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md
二叉树的坡度https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md
寻找最近的回文数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md
数组嵌套https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0565.Array%20Nesting/README.md
重塑矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md
字符串的排列https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0567.Permutation%20in%20String/README.md
最大休假天数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md
员工薪水中位数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0569.Median%20Employee%20Salary/README.md
至少有5名直接下属的经理https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md
给定数字的频率查询中位数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md
另一棵树的子树https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md
松鼠模拟https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0573.Squirrel%20Simulation/README.md
当选者https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0574.Winning%20Candidate/README.md
分糖果https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0575.Distribute%20Candies/README.md
出界的路径数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md
员工奖金https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0577.Employee%20Bonus/README.md
查询回答率最高的问题https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md
查询员工的累计薪水https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md
统计各专业学生人数https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md
最短无序连续子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md
杀掉进程https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0582.Kill%20Process/README.md
两个字符串的删除操作https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md
寻找用户推荐人https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0584.Find%20Customer%20Referee/README.md
2016年的投资https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0585.Investments%20in%202016/README.md
订单最多的客户https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md
安装栅栏https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0587.Erect%20the%20Fence/README.md
设计内存文件系统https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md
N 叉树的前序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md
N 叉树的后序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md
标签验证器https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0591.Tag%20Validator/README.md
分数加减运算https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md
有效的正方形https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0593.Valid%20Square/README.md
最长和谐子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md
大的国家https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0595.Big%20Countries/README.md
超过5名学生的课https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md
好友申请 I:总体通过率https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md
区间加法 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0598.Range%20Addition%20II/README.md
两个列表的最小索引总和https://github.com/gitbruce/leetcode2/blob/main/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md
不含连续1的非负整数https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md
体育馆的人流量https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md
好友申请 II :谁有最多的好友https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md
连续空余座位https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md
迭代压缩字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md
种花问题https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0605.Can%20Place%20Flowers/README.md
根据二叉树创建字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md
销售员https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0607.Sales%20Person/README.md
树节点https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0608.Tree%20Node/README.md
在系统中查找重复文件https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md
判断三角形https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0610.Triangle%20Judgement/README.md
有效三角形的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md
平面上的最近距离https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md
直线上的最近距离https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md
二级关注者https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0614.Second%20Degree%20Follower/README.md
平均工资:部门与公司比较https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md
给字符串添加加粗标签https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md
合并二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md
学生地理信息报告https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md
只出现一次的最大数字https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0619.Biggest%20Single%20Number/README.md
有趣的电影https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0620.Not%20Boring%20Movies/README.md
任务调度器https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0621.Task%20Scheduler/README.md
设计循环队列https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0622.Design%20Circular%20Queue/README.md
在二叉树中增加一行https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md
数组列表中的最大距离https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md
最小因式分解https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0625.Minimum%20Factorization/README.md
换座位https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0626.Exchange%20Seats/README.md
变更性别https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0627.Swap%20Salary/README.md
三个数的最大乘积https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md
K 个逆序对数组https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md
课程表 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0630.Course%20Schedule%20III/README.md
设计 Excel 求和公式https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md
最小区间https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md
平方数之和https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md
寻找数组的错位排列https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md
设计日志存储系统https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md
函数的独占时间https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md
二叉树的层平均值https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md
大礼包https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0638.Shopping%20Offers/README.md
解码方法 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0639.Decode%20Ways%20II/README.md
求解方程https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0640.Solve%20the%20Equation/README.md
设计循环双端队列https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0641.Design%20Circular%20Deque/README.md
设计搜索自动补全系统https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md
子数组最大平均数 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md
子数组最大平均数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md
错误的集合https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0645.Set%20Mismatch/README.md
最长数对链https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md
回文子串https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0647.Palindromic%20Substrings/README.md
单词替换https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0648.Replace%20Words/README.md
Dota2 参议院https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0649.Dota2%20Senate/README.md
两个键的键盘https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md
四个键的键盘https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md
寻找重复的子树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md
两数之和 IV - 输入二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md
最大二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md
输出二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0655.Print%20Binary%20Tree/README.md
金币路径https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0656.Coin%20Path/README.md
机器人能否返回原点https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md
找到 K 个最接近的元素https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md
分割数组为连续子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md
移除 9https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0660.Remove%209/README.md
图片平滑器https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0661.Image%20Smoother/README.md
二叉树最大宽度https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md
均匀树划分https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md
奇怪的打印机https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0664.Strange%20Printer/README.md
非递减数列https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0665.Non-decreasing%20Array/README.md
路径总和 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0666.Path%20Sum%20IV/README.md
优美的排列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md
乘法表中第k小的数https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md
修剪二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md
最大交换https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0670.Maximum%20Swap/README.md
二叉树中第二小的节点https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md
灯泡开关 Ⅱhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md
最长递增子序列的个数https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md
最长连续递增序列https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md
为高尔夫比赛砍树https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md
实现一个魔法字典https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md
键值映射https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md
有效的括号字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md
24 点游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0679.24%20Game/README.md
验证回文串 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md
最近时刻https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0681.Next%20Closest%20Time/README.md
棒球比赛https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0682.Baseball%20Game/README.md
K 个关闭的灯泡https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0683.K%20Empty%20Slots/README.md
冗余连接https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0684.Redundant%20Connection/README.md
冗余连接 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0685.Redundant%20Connection%20II/README.md
重复叠加字符串匹配https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0686.Repeated%20String%20Match/README.md
最长同值路径https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md
骑士在棋盘上的概率https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md
三个无重叠子数组的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md
员工的重要性https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0690.Employee%20Importance/README.md
贴纸拼词https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md
前K个高频单词https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md
交替位二进制数https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md
不同岛屿的数量https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md
岛屿的最大面积https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md
计数二进制子串https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md
数组的度https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md
划分为k个相等的子集https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md
掉落的方块https://github.com/gitbruce/leetcode2/blob/main/solution/0600-0699/0699.Falling%20Squares/README.md
二叉搜索树中的搜索https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md
二叉搜索树中的插入操作https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md
搜索长度未知的有序数组https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md
数据流中的第 K 大元素https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md
二分查找https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0704.Binary%20Search/README.md
设计哈希集合https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0705.Design%20HashSet/README.md
设计哈希映射https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0706.Design%20HashMap/README.md
设计链表https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0707.Design%20Linked%20List/README.md
循环有序列表的插入https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md
转换成小写字母https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0709.To%20Lower%20Case/README.md
黑名单中的随机数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md
不同岛屿的数量 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md
两个字符串的最小ASCII删除和https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md
乘积小于 K 的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md
买卖股票的最佳时机含手续费https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md
Range 模块https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0715.Range%20Module/README.md
最大栈https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0716.Max%20Stack/README.md
1 比特与 2 比特字符https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md
最长重复子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md
找出第 K 小的数对距离https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md
词典中最长的单词https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md
账户合并https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0721.Accounts%20Merge/README.md
删除注释https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0722.Remove%20Comments/README.md
粉碎糖果https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0723.Candy%20Crush/README.md
寻找数组的中心下标https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0724.Find%20Pivot%20Index/README.md
分隔链表https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md
原子的数量https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0726.Number%20of%20Atoms/README.md
最小窗口子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md
自除数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md
我的日程安排表 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0729.My%20Calendar%20I/README.md
统计不同回文子序列https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md
我的日程安排表 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0731.My%20Calendar%20II/README.md
我的日程安排表 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0732.My%20Calendar%20III/README.md
图像渲染https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0733.Flood%20Fill/README.md
句子相似性https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0734.Sentence%20Similarity/README.md
小行星碰撞https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0735.Asteroid%20Collision/README.md
Lisp 语法解析https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md
句子相似性 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md
单调递增的数字https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md
每日温度https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0739.Daily%20Temperatures/README.md
删除并获得点数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0740.Delete%20and%20Earn/README.md
摘樱桃https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0741.Cherry%20Pickup/README.md
二叉树最近的叶节点https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md
网络延迟时间https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0743.Network%20Delay%20Time/README.md
寻找比目标字母大的最小字母https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md
前缀和后缀搜索https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md
使用最小花费爬楼梯https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md
至少是其他数字两倍的最大数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md
最短补全词https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md
隔离病毒https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0749.Contain%20Virus/README.md
角矩形的数量https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md
IP 到 CIDRhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0751.IP%20to%20CIDR/README.md
打开转盘锁https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0752.Open%20the%20Lock/README.md
破解保险箱https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0753.Cracking%20the%20Safe/README.md
到达终点数字https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0754.Reach%20a%20Number/README.md
倒水https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0755.Pour%20Water/README.md
金字塔转换矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md
设置交集大小至少为2https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md
字符串中的加粗单词https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md
员工空闲时间https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0759.Employee%20Free%20Time/README.md
找出变位映射https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md
特殊的二进制序列https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0761.Special%20Binary%20String/README.md
二进制表示中质数个计算置位https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md
划分字母区间https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0763.Partition%20Labels/README.md
最大加号标志https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md
情侣牵手https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md
托普利茨矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0766.Toeplitz%20Matrix/README.md
重构字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0767.Reorganize%20String/README.md
最多能完成排序的块 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md
最多能完成排序的块https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md
基本计算器 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md
宝石与石头https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0771.Jewels%20and%20Stones/README.md
基本计算器 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0772.Basic%20Calculator%20III/README.md
滑动谜题https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0773.Sliding%20Puzzle/README.md
最小化去加油站的最大距离https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md
全局倒置与局部倒置https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md
拆分二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0776.Split%20BST/README.md
在LR字符串中交换相邻字符https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md
水位上升的泳池中游泳https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md
第K个语法符号https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md
到达终点https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0780.Reaching%20Points/README.md
森林中的兔子https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md
变为棋盘https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md
二叉搜索树节点最小距离https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md
字母大小写全排列https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md
判断二分图https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md
第 K 个最小的质数分数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md
K 站中转内最便宜的航班https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md
旋转数字https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0788.Rotated%20Digits/README.md
逃脱阻碍者https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md
多米诺和托米诺平铺https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md
自定义字符串排序https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0791.Custom%20Sort%20String/README.md
匹配子序列的单词数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md
阶乘函数后 K 个零https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md
有效的井字游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md
区间子数组个数https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md
旋转字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0796.Rotate%20String/README.md
所有可能的路径https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md
得分最高的最小轮调https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md
香槟塔https://github.com/gitbruce/leetcode2/blob/main/solution/0700-0799/0799.Champagne%20Tower/README.md
相似 RGB 颜色https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0800.Similar%20RGB%20Color/README.md
使序列递增的最小交换次数https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md
找到最终的安全状态https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md
打砖块https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md
唯一摩尔斯密码词https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md
数组的均值分割https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md
写字符串需要的行数https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md
保持城市天际线https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md
分汤https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0808.Soup%20Servings/README.md
情感丰富的文字https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0809.Expressive%20Words/README.md
黑板异或游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md
子域名访问计数https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md
最大三角形面积https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md
最大平均值和的分组https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md
二叉树剪枝https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md
公交路线https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0815.Bus%20Routes/README.md
模糊坐标https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md
链表组件https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0817.Linked%20List%20Components/README.md
赛车https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0818.Race%20Car/README.md
最常见的单词https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0819.Most%20Common%20Word/README.md
单词的压缩编码https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md
字符的最短距离https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md
翻转卡片游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0822.Card%20Flipping%20Game/README.md
带因子的二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md
山羊拉丁文https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0824.Goat%20Latin/README.md
适龄的朋友https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md
安排工作以达到最大收益https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md
最大人工岛https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md
统计子串中的唯一字符https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md
连续整数求和https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md
较大分组的位置https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md
隐藏个人信息https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0831.Masking%20Personal%20Information/README.md
翻转图像https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0832.Flipping%20an%20Image/README.md
字符串中的查找与替换https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md
树中距离之和https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md
图像重叠https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0835.Image%20Overlap/README.md
矩形重叠https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0836.Rectangle%20Overlap/README.md
新 21 点https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0837.New%2021%20Game/README.md
推多米诺https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0838.Push%20Dominoes/README.md
相似字符串组https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0839.Similar%20String%20Groups/README.md
矩阵中的幻方https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md
钥匙和房间https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0841.Keys%20and%20Rooms/README.md
将数组拆分成斐波那契序列https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md
猜猜这个单词https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0843.Guess%20the%20Word/README.md
比较含退格的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0844.Backspace%20String%20Compare/README.md
数组中的最长山脉https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md
一手顺子https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0846.Hand%20of%20Straights/README.md
访问所有节点的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md
字母移位https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0848.Shifting%20Letters/README.md
到最近的人的最大距离https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md
矩形面积 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0850.Rectangle%20Area%20II/README.md
喧闹和富有https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0851.Loud%20and%20Rich/README.md
山脉数组的峰顶索引https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md
车队https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0853.Car%20Fleet/README.md
相似度为 K 的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0854.K-Similar%20Strings/README.md
考场就座https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0855.Exam%20Room/README.md
括号的分数https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0856.Score%20of%20Parentheses/README.md
雇佣 K 名工人的最低成本https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md
镜面反射https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0858.Mirror%20Reflection/README.md
亲密字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0859.Buddy%20Strings/README.md
柠檬水找零https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0860.Lemonade%20Change/README.md
翻转矩阵后的得分https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md
和至少为 K 的最短子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md
二叉树中所有距离为 K 的结点https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md
获取所有钥匙的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md
具有所有最深节点的最小子树https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md
回文质数https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0866.Prime%20Palindrome/README.md
转置矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0867.Transpose%20Matrix/README.md
二进制间距https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0868.Binary%20Gap/README.md
重新排序得到 2 的幂https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md
优势洗牌https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0870.Advantage%20Shuffle/README.md
最低加油次数https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md
叶子相似的树https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md
最长的斐波那契子序列的长度https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md
模拟行走机器人https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md
爱吃香蕉的珂珂https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md
链表的中间结点https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md
石子游戏https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0877.Stone%20Game/README.md
第 N 个神奇数字https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0878.Nth%20Magical%20Number/README.md
盈利计划https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0879.Profitable%20Schemes/README.md
索引处的解码字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md
救生艇https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md
细分图中的可到达节点https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md
三维形体投影面积https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md
两句话中的不常见单词https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md
螺旋矩阵 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md
可能的二分法https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0886.Possible%20Bipartition/README.md
鸡蛋掉落https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0887.Super%20Egg%20Drop/README.md
公平的糖果交换https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md
根据前序和后序遍历构造二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md
查找和替换模式https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md
子序列宽度之和https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md
三维形体的表面积https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md
特殊等价字符串组https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md
所有可能的真二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md
最大频率栈https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md
单调数列https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0896.Monotonic%20Array/README.md
递增顺序搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md
子数组按位或操作https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md
有序队列https://github.com/gitbruce/leetcode2/blob/main/solution/0800-0899/0899.Orderly%20Queue/README.md
RLE 迭代器https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0900.RLE%20Iterator/README.md
股票价格跨度https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0901.Online%20Stock%20Span/README.md
最大为 N 的数字组合https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md
DI 序列的有效排列https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md
水果成篮https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md
按奇偶排序数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md
超级回文数https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0906.Super%20Palindromes/README.md
子数组的最小值之和https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md
最小差值 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0908.Smallest%20Range%20I/README.md
蛇梯棋https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md
最小差值 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0910.Smallest%20Range%20II/README.md
在线选举https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0911.Online%20Election/README.md
排序数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0912.Sort%20an%20Array/README.md
猫和老鼠https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0913.Cat%20and%20Mouse/README.md
卡牌分组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md
分割数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md
单词子集https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0916.Word%20Subsets/README.md
仅仅反转字母https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md
环形子数组的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md
完全二叉树插入器https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md
播放列表的数量https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md
使括号有效的最少添加https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md
按奇偶排序数组 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md
三数之和的多种可能https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md
尽量减少恶意软件的传播https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md
长按键入https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0925.Long%20Pressed%20Name/README.md
将字符串翻转到单调递增https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md
三等分https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0927.Three%20Equal%20Parts/README.md
尽量减少恶意软件的传播 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md
独特的电子邮件地址https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md
和相同的二元子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md
下降路径最小和https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md
漂亮数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0932.Beautiful%20Array/README.md
最近的请求次数https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md
最短的桥https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0934.Shortest%20Bridge/README.md
骑士拨号器https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0935.Knight%20Dialer/README.md
戳印序列https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md
重新排列日志文件https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md
二叉搜索树的范围和https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md
最小面积矩形https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md
不同的子序列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md
有效的山脉数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md
增减字符串匹配https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0942.DI%20String%20Match/README.md
最短超级串https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md
删列造序https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md
使数组唯一的最小增量https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md
验证栈序列https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md
移除最多的同行或同列石头https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md
令牌放置https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0948.Bag%20of%20Tokens/README.md
给定数字能组成的最大时间https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md
按递增顺序显示卡牌https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md
翻转等价二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md
按公因数计算最大组件大小https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md
验证外星语词典https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md
二倍数对数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md
删列造序 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md
最高的广告牌https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0956.Tallest%20Billboard/README.md
N 天后的牢房https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md
二叉树的完全性检验https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md
由斜杠划分区域https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md
删列造序 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md
在长度 2N 的数组中找出重复 N 次的元素https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md
最大宽度坡https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md
最小面积矩形 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md
表示数字的最少运算符https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md
单值二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md
元音拼写检查器https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0966.Vowel%20Spellchecker/README.md
连续差相同的数字https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md
监控二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md
煎饼排序https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0969.Pancake%20Sorting/README.md
强整数https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0970.Powerful%20Integers/README.md
翻转二叉树以匹配先序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md
相等的有理数https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md
最接近原点的 K 个点https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md
和可被 K 整除的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md
奇偶跳https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0975.Odd%20Even%20Jump/README.md
三角形的最大周长https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md
有序数组的平方https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md
最长湍流子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md
在二叉树中分配硬币https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md
不同路径 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0980.Unique%20Paths%20III/README.md
基于时间的键值存储https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md
按位与为零的三元组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md
最低票价https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md
不含 AAA 或 BBB 的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md
查询后的偶数和https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md
区间列表的交集https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0986.Interval%20List%20Intersections/README.md
二叉树的垂序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md
从叶结点开始的最小字符串https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md
数组形式的整数加法https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md
等式方程的可满足性https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md
坏了的计算器https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0991.Broken%20Calculator/README.md
K 个不同整数的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md
二叉树的堂兄弟节点https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md
腐烂的橘子https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0994.Rotting%20Oranges/README.md
K 连续位的最小翻转次数https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md
正方形数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md
找到小镇的法官https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md
最大二叉树 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md
可以被一步捕获的棋子数https://github.com/gitbruce/leetcode2/blob/main/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md
合并石头的最低成本https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md
网格照明https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1001.Grid%20Illumination/README.md
查找共用字符https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1002.Find%20Common%20Characters/README.md
检查替换后的词是否有效https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md
最大连续1的个数 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md
K 次取反后最大化的数组和https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md
笨阶乘https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1006.Clumsy%20Factorial/README.md
行相等的最少多米诺旋转https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md
前序遍历构造二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md
十进制整数的反码https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md
总持续时间可被 60 整除的歌曲https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md
在 D 天内送达包裹的能力https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md
至少有 1 位重复的数字https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md
将数组分成和相等的三个部分https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md
最佳观光组合https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md
可被 K 整除的最小整数https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md
子串能表示从 1 到 N 数字的二进制串https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md
负二进制转换https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md
可被 5 整除的二进制前缀https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md
链表中的下一个更大节点https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md
飞地的数量https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1020.Number%20of%20Enclaves/README.md
删除最外层的括号https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md
从根到叶的二进制数之和https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md
驼峰式匹配https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1023.Camelcase%20Matching/README.md
视频拼接https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1024.Video%20Stitching/README.md
除数博弈https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1025.Divisor%20Game/README.md
节点与其祖先之间的最大差值https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md
最长等差数列https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md
从先序遍历还原二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md
两地调度https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1029.Two%20City%20Scheduling/README.md
距离顺序排列矩阵单元格https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md
两个非重叠子数组的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md
字符流https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1032.Stream%20of%20Characters/README.md
移动石子直到连续https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md
边界着色https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1034.Coloring%20A%20Border/README.md
不相交的线https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1035.Uncrossed%20Lines/README.md
逃离大迷宫https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md
有效的回旋镖https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1037.Valid%20Boomerang/README.md
从二叉搜索树到更大和树https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md
多边形三角剖分的最低得分https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md
移动石子直到连续 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md
困于环中的机器人https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md
不邻接植花https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md
分隔数组以得到最大和https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md
最长重复子串https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md
买下所有产品的客户https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md
最后一块石头的重量https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1046.Last%20Stone%20Weight/README.md
删除字符串中的所有相邻重复项https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md
最长字符串链https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1048.Longest%20String%20Chain/README.md
最后一块石头的重量 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md
合作过至少三次的演员和导演https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md
高度检查器https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1051.Height%20Checker/README.md
爱生气的书店老板https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md
交换一次的先前排列https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md
距离相等的条形码https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1054.Distant%20Barcodes/README.md
形成字符串的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md
易混淆数https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1056.Confusing%20Number/README.md
校园自行车分配https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1057.Campus%20Bikes/README.md
最小化舍入误差以满足目标https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md
从始点到终点的所有路径https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md
有序数组中的缺失元素https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md
按字典序排列最小的等效字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md
最长重复子串https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md
有效子数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md
不动点https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1064.Fixed%20Point/README.md
字符串的索引对https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md
校园自行车分配 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1066.Campus%20Bikes%20II/README.md
范围内的数字计数https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md
产品销售分析 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md
产品销售分析 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md
产品销售分析 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md
字符串的最大公因子https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md
按列翻转得到最大值等行数https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md
负二进制数相加https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md
元素和为目标值的子矩阵数量https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md
项目员工 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1075.Project%20Employees%20I/README.md
项目员工IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1076.Project%20Employees%20II/README.md
项目员工 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1077.Project%20Employees%20III/README.md
Bigram 分词https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md
活字印刷https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md
根到叶路径上的不足节点https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md
不同字符的最小子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md
销售分析 I https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1082.Sales%20Analysis%20I/README.md
销售分析 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1083.Sales%20Analysis%20II/README.md
销售分析IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1084.Sales%20Analysis%20III/README.md
最小元素各数位之和https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md
前五科的均分https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1086.High%20Five/README.md
花括号展开https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1087.Brace%20Expansion/README.md
易混淆数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1088.Confusing%20Number%20II/README.md
复写零https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1089.Duplicate%20Zeros/README.md
受标签影响的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md
二进制矩阵中的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md
最短公共超序列https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md
大样本统计https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md
拼车https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1094.Car%20Pooling/README.md
山脉数组中查找目标值https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md
花括号展开 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1096.Brace%20Expansion%20II/README.md
游戏玩法分析 Vhttps://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md
小众书籍https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1098.Unpopular%20Books/README.md
小于 K 的两数之和https://github.com/gitbruce/leetcode2/blob/main/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md
长度为 K 的无重复字符子串https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md
彼此熟识的最早时间https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md
得分最高的路径https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md
分糖果 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md
二叉树寻路https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md
填充书架https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md
解析布尔表达式https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md
每日新用户统计https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md
IP 地址无效化https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md
航班预订统计https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md
删点成林https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md
有效括号的嵌套深度https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md
每位学生的最高成绩https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md
报告的记录https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1113.Reported%20Posts/README.md
按序打印https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1114.Print%20in%20Order/README.md
交替打印 FooBarhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md
打印零与奇偶数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md
H2O 生成https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1117.Building%20H2O/README.md
一月有多少天https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md
删去字符串中的元音https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md
子树的最大平均值https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md
将数组分成几个递增序列https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md
数组的相对排序https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1122.Relative%20Sort%20Array/README.md
最深叶节点的最近公共祖先https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md
表现良好的最长时间段https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md
最小的必要团队https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md
查询活跃业务https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1126.Active%20Businesses/README.md
用户购买平台https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1127.User%20Purchase%20Platform/README.md
等价多米诺骨牌对的数量https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md
颜色交替的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md
叶值的最小代价生成树https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md
绝对值表达式的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md
报告的记录 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1132.Reported%20Posts%20II/README.md
最大唯一数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1133.Largest%20Unique%20Number/README.md
阿姆斯特朗数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1134.Armstrong%20Number/README.md
最低成本连通所有城市https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md
并行课程https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1136.Parallel%20Courses/README.md
第 N 个泰波那契数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md
字母板上的路径https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md
最大的以 1 为边界的正方形https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md
石子游戏 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1140.Stone%20Game%20II/README.md
查询近30天活跃用户数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md
过去30天的用户活动 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md
最长公共子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md
递减元素使数组呈锯齿状https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md
二叉树着色游戏https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md
快照数组https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1146.Snapshot%20Array/README.md
段式回文https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md
文章浏览 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1148.Article%20Views%20I/README.md
文章浏览 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1149.Article%20Views%20II/README.md
检查一个数是否在数组中占绝大多数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md
最少交换次数来组合所有的 1https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md
用户网站访问行为分析https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md
字符串转化https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md
一年中的第几天https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1154.Day%20of%20the%20Year/README.md
掷骰子等于目标和的方法数https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md
单字符重复子串的最大长度https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md
子数组中占绝大多数的元素https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md
市场分析 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1158.Market%20Analysis%20I/README.md
市场分析 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1159.Market%20Analysis%20II/README.md
拼写单词https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md
最大层内元素和https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md
地图分析https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md
按字典序排在最后的子串https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md
指定日期的产品价格https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md
单行键盘https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1165.Single-Row%20Keyboard/README.md
设计文件系统https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1166.Design%20File%20System/README.md
连接木棍的最低费用https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md
水资源分配优化https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md
查询无效交易https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1169.Invalid%20Transactions/README.md
比较字符串最小字母出现频次https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md
从链表中删去总和值为零的连续节点https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md
餐盘栈https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md
即时食物配送 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md
即时食物配送 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md
质数排列https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1175.Prime%20Arrangements/README.md
健身计划评估https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md
构建回文串检测https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md
猜字谜https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md
重新格式化部门表https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1179.Reformat%20Department%20Table/README.md
统计只含单一字母的子串https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md
前后拼接https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md
与目标颜色间的最短距离https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md
矩阵中 1 的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md
公交站间的距离https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md
一周中的第几天https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1185.Day%20of%20the%20Week/README.md
删除一次得到子数组最大和https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md
使数组严格递增https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md
设计有限阻塞队列https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md
“气球” 的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md
反转每对括号间的子串https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md
K 次串联后最大子数组之和https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md
查找集群内的关键连接https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md
每月交易 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md
锦标赛优胜者https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1194.Tournament%20Winners/README.md
交替打印字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md
最多可以买到的苹果数量https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md
进击的骑士https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md
找出所有行中最小公共元素https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md
建造街区的最短时间https://github.com/gitbruce/leetcode2/blob/main/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md
最小绝对差https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md
丑数 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1201.Ugly%20Number%20III/README.md
交换字符串中的元素https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md
项目管理https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md
最后一个能进入巴士的人https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README.md
每月交易 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md
设计跳表https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1206.Design%20Skiplist/README.md
独一无二的出现次数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md
尽可能使字符串相等https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md
删除字符串中的所有相邻重复项 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md
穿过迷宫的最少移动次数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md
查询结果的质量和占比https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md
查询球队积分https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md
三个有序数组的交集https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md
查找两棵二叉搜索树之和https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md
步进数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1215.Stepping%20Numbers/README.md
验证回文串 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md
玩筹码https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md
最长定差子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md
黄金矿工https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md
统计元音字母序列的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md
分割平衡字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md
可以攻击国王的皇后https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md
掷骰子模拟https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md
最大相等频率https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md
报告系统状态的连续日期https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md
哲学家进餐https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md
飞机座位分配概率https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md
等差数列中缺失的数字https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md
安排会议日程https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1229.Meeting%20Scheduler/README.md
抛掷硬币https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md
分享巧克力https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1231.Divide%20Chocolate/README.md
缀点成线https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md
删除子文件夹https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md
替换子串得到平衡字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md
规划兼职工作https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md
网络爬虫https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1236.Web%20Crawler/README.md
找出给定方程的正整数解https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md
循环码排列https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md
串联字符串的最大长度https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md
铺瓷砖https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md
每个帖子的评论数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md
多线程网页爬虫https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md
数组变换https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1243.Array%20Transformation/README.md
力扣排行榜https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md
树的直径https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1245.Tree%20Diameter/README.md
删除回文子数组https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1246.Palindrome%20Removal/README.md
交换字符使得字符串相同https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md
统计「优美子数组」https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md
移除无效的括号https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md
检查「好数组」https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md
平均售价https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1251.Average%20Selling%20Price/README.md
奇数值单元格的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md
重构 2 行二进制矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md
统计封闭岛屿的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md
得分最高的单词集合https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md
加密数字https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1256.Encode%20Number/README.md
最小公共区域https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1257.Smallest%20Common%20Region/README.md
近义词句子https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1258.Synonymous%20Sentences/README.md
不相交的握手https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md
二维网格迁移https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1260.Shift%202D%20Grid/README.md
在受污染的二叉树中查找元素https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md
可被三整除的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md
推箱子https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md
页面推荐https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1264.Page%20Recommendations/README.md
逆序打印不可变链表https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md
访问所有点的最小时间https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md
统计参与通信的服务器https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md
搜索推荐系统https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1268.Search%20Suggestions%20System/README.md
停在原地的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md
向公司 CEO 汇报工作的所有人https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md
十六进制魔术数字https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1271.Hexspeak/README.md
删除区间https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1272.Remove%20Interval/README.md
删除树节点https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md
矩形内船只的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md
找出井字棋的获胜者https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md
不浪费原料的汉堡制作方案https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md
统计全为 1 的正方形子矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md
分割回文串 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md
红绿灯路口https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md
学生们参加各科测试的次数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1280.Students%20and%20Examinations/README.md
整数的各位积和之差https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md
用户分组https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md
使结果不超过阈值的最小除数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md
转化为全零矩阵的最少反转次数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md
找到连续区间的开始和结束数字https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md
字母组合迭代器https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1286.Iterator%20for%20Combination/README.md
有序数组中出现次数超过25%的元素https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md
删除被覆盖区间https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md
下降路径最小和 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md
二进制链表转整数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md
顺次数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1291.Sequential%20Digits/README.md
元素和小于等于阈值的正方形的最大边长https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md
网格中的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md
不同国家的天气类型https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md
统计位数为偶数的数字https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md
划分数组为连续数字的集合https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md
子串的最大出现次数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md
你能从盒子里获得的最大糖果数https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md
将每个元素替换为右侧最大元素https://github.com/gitbruce/leetcode2/blob/main/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md
转变数组后最接近目标值的数组和https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md
最大得分的路径数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md
层数最深叶子节点的和https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md
求团队人数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md
和为零的 N 个不同整数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md
两棵二叉搜索树中的所有元素https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md
跳跃游戏 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1306.Jump%20Game%20III/README.md
口算难题https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md
不同性别每日分数总计https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md
解码字母到整数映射https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md
子数组异或查询https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md
获取你好友已观看的视频https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md
让字符串成为回文串的最少插入次数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md
解压缩编码列表https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md
矩阵区域和https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md
祖父节点值为偶数的节点和https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md
不同的循环子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md
将整数转换为两个无零整数的和https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md
或运算的最小翻转次数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md
连通网络的操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md
二指输入的的最小距离https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md
餐馆营业额变化增长https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1321.Restaurant%20Growth/README.md
广告效果https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1322.Ads%20Performance/README.md
6 和 9 组成的最大数字https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1323.Maximum%2069%20Number/README.md
竖直打印单词https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1324.Print%20Words%20Vertically/README.md
删除给定值的叶子节点https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md
灌溉花园的最少水龙头数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md
列出指定时间段内所有的下单产品https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README.md
破坏回文串https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1328.Break%20a%20Palindrome/README.md
将矩阵按对角线排序https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md
翻转子数组得到最大的数组值https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md
数组序号转换https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md
删除回文子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md
餐厅过滤器https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md
阈值距离内邻居最少的城市https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md
工作计划的最低难度https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md
每次访问的交易次数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md
矩阵中战斗力最弱的 K 行https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md
数组大小减半https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md
分裂二叉树的最大乘积https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md
跳跃游戏 Vhttps://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1340.Jump%20Game%20V/README.md
电影评分https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1341.Movie%20Rating/README.md
将数字变成 0 的操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md
大小为 K 且平均值大于等于阈值的子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md
时钟指针的夹角https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md
跳跃游戏 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1345.Jump%20Game%20IV/README.md
检查整数及其两倍数是否存在https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md
制造字母异位词的最小步骤数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md
推文计数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md
参加考试的最大学生数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md
院系无效的学生https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md
统计有序矩阵中的负数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md
最后 K 个数的乘积https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md
最多可以参加的会议数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md
多次求和构造目标数组https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md
活动参与者https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1355.Activity%20Participants/README.md
根据数字二进制下 1 的数目排序https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md
每隔 n 个顾客打折https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md
包含所有三种字符的子字符串数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md
有效的快递序列数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md
日期之间隔几天https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md
验证二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md
最接近的因数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1362.Closest%20Divisors/README.md
形成三的最大倍数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md
顾客的可信联系人数量https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md
有多少小于当前数字的数字https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md
通过投票对团队排名https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md
二叉树中的链表https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md
使网格图至少有一条有效路径的最小代价https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md
获取最近第二次的活动https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md
上升下降字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md
每个元音包含偶数次的最长子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md
二叉树中的最长交错路径https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md
二叉搜索子树的最大键值和https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md
生成每种字符都是奇数个的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md
二进制字符串前缀一致的次数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md
通知所有员工所需的时间https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md
T 秒后青蛙的位置https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md
使用唯一标识码替换员工IDhttps://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md
找出克隆二叉树中的相同节点https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md
矩阵中的幸运数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md
设计一个支持增量操作的栈https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md
将二叉搜索树变平衡https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md
最大的团队表现值https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md
按年度列出销售总额https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md
两个数组间的距离值https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md
安排电影院座位https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md
将整数按权重排序https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md
3n 块披萨https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md
按既定顺序创建目标数组https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md
四因数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1390.Four%20Divisors/README.md
检查网格中是否存在有效路径https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md
最长快乐前缀https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md
股票的资本损益https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1393.Capital%20GainLoss/README.md
找出数组中的幸运数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md
统计作战单位数https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md
设计地铁系统https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1396.Design%20Underground%20System/README.md
找到所有好字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md
购买了产品 A 和产品 B 却没有购买产品 C 的顾客https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md
统计最大组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1300-1399/1399.Count%20Largest%20Group/README.md
构造 K 个回文字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md
圆和矩形是否有重叠https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md
做菜顺序https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1402.Reducing%20Dishes/README.md
非递增顺序的最小子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md
将二进制表示减到 1 的步骤数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md
最长快乐字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1405.Longest%20Happy%20String/README.md
石子游戏 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1406.Stone%20Game%20III/README.md
排名靠前的旅行者https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1407.Top%20Travellers/README.md
数组中的字符串匹配https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md
查询带键的排列https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md
HTML 实体解析器https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md
给 N x 3 网格图涂色的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md
查找成绩处于中游的学生https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md
逐步求和得到正数的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md
和为 K 的最少斐波那契数字数目https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md
长度为 n 的开心字符串中字典序第 k 小的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md
重新格式化字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1417.Reformat%20The%20String/README.md
点菜展示表https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md
数青蛙https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md
生成数组https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md
净现值查询https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1421.NPV%20Queries/README.md
分割字符串的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md
可获得的最大点数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md
对角线遍历 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md
带限制的子序列和https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md
数元素https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1426.Counting%20Elements/README.md
字符串的左右移https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1427.Perform%20String%20Shifts/README.md
至少有一个 1 的最左端列https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md
第一个唯一数字https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1429.First%20Unique%20Number/README.md
判断给定的序列是否是二叉树从根到叶的路径https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md
拥有最多糖果的孩子https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md
改变一个整数能得到的最大差值https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md
检查一个字符串是否可以打破另一个字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md
每个人戴不同帽子的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md
制作会话柱状图https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md
旅行终点站https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1436.Destination%20City/README.md
是否所有 1 都至少相隔 k 个元素https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md
绝对差不超过限制的最长连续子数组https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md
有序矩阵中的第 k 个最小数组和https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md
计算布尔表达式的值https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md
用栈操作构建数组https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md
形成两个异或相等数组的三元组数目https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md
收集树上所有苹果的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md
切披萨的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md
苹果和桔子https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md
连续字符https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1446.Consecutive%20Characters/README.md
最简分数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1447.Simplified%20Fractions/README.md
统计二叉树中好节点的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md
数位成本和为目标值的最大数字https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md
在既定时间做作业的学生人数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md
重新排列句子中的单词https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md
收藏清单https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md
圆形靶内的最大飞镖数量https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md
活跃用户https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1454.Active%20Users/README.md
检查单词是否为句中其他单词的前缀https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md
定长子串中元音的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md
二叉树中的伪回文路径https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md
两个子序列的最大点积https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md
矩形面积https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1459.Rectangles%20Area/README.md
通过翻转子数组使两个数组相等https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README.md
检查一个字符串是否包含所有长度为 K 的二进制子串https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md
课程表 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1462.Course%20Schedule%20IV/README.md
摘樱桃 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md
数组中两元素的最大乘积https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md
切割后面积最大的蛋糕https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md
重新规划路线https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md
两个盒子中球的颜色数相同的概率https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md
计算税后工资https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1468.Calculate%20Salaries/README.md
寻找所有的独生节点https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md
重新排列数组https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1470.Shuffle%20the%20Array/README.md
数组中的 k 个最强值https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md
设计浏览器历史记录https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1472.Design%20Browser%20History/README.md
粉刷房子 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1473.Paint%20House%20III/README.md
删除链表 M 个节点之后的 N 个节点https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md
商品折扣后的最终价格https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md
子矩形查询https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1476.Subrectangle%20Queries/README.md
找两个和为目标值且不重叠的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md
安排邮筒https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1478.Allocate%20Mailboxes/README.md
周内每天的销售情况https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md
一维数组的动态和https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md
不同整数的最少数目https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md
制作 m 束花所需的最少天数https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md
树节点的第 K 个祖先https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md
按日期分组销售产品https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md
克隆含随机指针的二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md
数组异或操作https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md
保证文件名唯一https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md
避免洪水泛滥https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md
找到最小生成树里的关键边和伪关键边https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md
克隆 N 叉树https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md
去掉最低工资和最高工资后的工资平均值https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md
n 的第 k 个因子https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md
删掉一个元素以后全为 1 的最长子数组https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md
并行课程 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1494.Parallel%20Courses%20II/README.md
上月播放的儿童适宜电影https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md
判断路径是否相交https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1496.Path%20Crossing/README.md
检查数组对是否可以被 k 整除https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md
满足条件的子序列数目https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md
满足不等式的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md
设计文件分享系统https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md
可以放心投资的国家https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md
判断能否形成等差数列https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md
所有蚂蚁掉下来前的最后一刻https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md
统计全 1 子矩形https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md
最多 K 次交换相邻数位后得到的最小整数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md
找到 N 叉树的根节点https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md
转变日期格式https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1507.Reformat%20Date/README.md
子数组和排序后的区间和https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md
三次操作后最大值与最小值的最小差https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md
石子游戏 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1510.Stone%20Game%20IV/README.md
消费者下单频率https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md
好数对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md
仅含 1 的子串数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md
概率最大的路径https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md
服务中心的最佳位置https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md
移动 N 叉树的子树https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md
查找拥有有效邮箱的用户https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md
换水问题https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1518.Water%20Bottles/README.md
子树中标签相同的节点数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md
最多的不重叠子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md
找到最接近目标值的函数值https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md
N 叉树的直径https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md
在区间范围内统计奇数数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md
和为奇数的子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md
字符串的好分割数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md
形成目标数组的子数组最少增加次数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md
患某种疾病的患者https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md
重新排列字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1528.Shuffle%20String/README.md
最少的后缀翻转次数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md
好叶子节点对的数量https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md
压缩字符串 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1531.String%20Compression%20II/README.md
最近的三笔订单https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md
找到最大整数的索引https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md
统计好三元组https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1534.Count%20Good%20Triplets/README.md
找出数组游戏的赢家https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md
排布二进制网格的最少交换次数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md
最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md
找出隐藏数组中出现次数最多的元素https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md
第 k 个缺失的正整数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md
K 次操作转变字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md
平衡括号字符串的最少插入次数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md
找出最长的超赞子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md
产品名称格式修复https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md
整理字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1544.Make%20The%20String%20Great/README.md
找出第 N 个二进制字符串中的第 K 位https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md
和为目标值且不重叠的非空子数组的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md
切棍子的最小成本https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md
图中最相似的路径https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md
每件商品的最新订单https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md
存在连续三个奇数的数组https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md
使数组中所有元素相等的最小操作数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md
两球之间的磁力https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md
吃掉 N 个橘子的最少天数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md
只有一个不同字符的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md
银行账户概要https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1555.Bank%20Account%20Summary/README.md
千位分隔数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1556.Thousand%20Separator/README.md
可以到达所有点的最少点数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md
得到目标数组的最少函数调用次数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md
二维网格图中探测环https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md
圆形赛道上经过次数最多的扇区https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md
你可以获得的最大硬币数目https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md
查找大小为 M 的最新分组https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md
石子游戏 Vhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1563.Stone%20Game%20V/README.md
把箱子放进仓库里 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md
按月统计订单数与顾客数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md
重复至少 K 次且长度为 M 的模式https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md
乘积为正数的最长子数组长度https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md
使陆地分离的最少天数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md
将子数组重新排序得到同一个二叉搜索树的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md
两个稀疏向量的点积https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md
仓库经理https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1571.Warehouse%20Manager/README.md
矩阵对角线元素的和https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md
分割字符串的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md
删除最短的子数组使剩余数组有序https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md
统计所有可行路径https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md
替换所有的问号https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md
数的平方等于两数乘积的方法数https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md
使绳子变成彩色的最短时间https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md
保证图可完全遍历https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md
把箱子放进仓库里 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md
进店却未进行过交易的顾客https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README.md
二进制矩阵中的特殊位置https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md
统计不开心的朋友https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md
连接所有点的最小费用https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md
检查字符串是否可以通过排序子字符串得到另一个字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md
二叉搜索树迭代器 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md
银行账户概要 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README.md
所有奇数长度子数组的和https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md
所有排列中的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md
使数组和能被 P 整除https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md
奇怪的打印机 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1591.Strange%20Printer%20II/README.md
重新排列单词间的空格https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md
拆分字符串使唯一子字符串的数目最大https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md
矩阵的最大非负积https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md
连通两组点的最小成本https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md
每位顾客最经常订购的商品https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md
根据中缀表达式构造二叉表达式树https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md
文件夹操作日志搜集器https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md
经营摩天轮的最大利润https://github.com/gitbruce/leetcode2/blob/main/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md
王位继承顺序https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1600.Throne%20Inheritance/README.md
最多可达成的换楼请求数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md
找到二叉树中最近的右侧节点https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md
设计停车系统https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1603.Design%20Parking%20System/README.md
警告一小时内使用相同员工卡大于等于三次的人https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md
给定行和列的和求可行矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md
找到处理最多请求的服务器https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md
没有卖出的卖家https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md
特殊数组的特征值https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md
奇偶树https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1609.Even%20Odd%20Tree/README.md
可见点的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md
使整数变为 0 的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md
检查两棵二叉表达式树是否等价https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md
找到遗失的IDhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md
括号的最大嵌套深度https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md
最大网络秩https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md
分割两个字符串得到回文串https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md
统计子树中城市之间最大距离https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md
找出适应屏幕的最大字号https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md
删除某些元素后的数组均值https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md
网络信号最好的坐标https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md
大小为 K 的不重叠线段的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md
奇妙序列https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1622.Fancy%20Sequence/README.md
三人国家代表队https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md
两个相同字符之间的最长子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md
执行操作后字典序最小的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md
无矛盾的最佳球队https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md
带阈值的图连通性https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md
设计带解析函数的表达式树https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md
按键持续时间最长的键https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1629.Slowest%20Key/README.md
等差子数组https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md
最小体力消耗路径https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md
矩阵转换后的秩https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md
各赛事的用户注册率https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README.md
求两个多项式链表的和https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md
Hopper 公司查询 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md
按照频率将数组升序排序https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md
两点之间不包含任何点的最宽垂直区域https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md
统计只差一个字符的子串数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md
通过给定词典构造目标字符串的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md
能否连接形成数组https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md
统计字典序元音字符串的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md
可以到达的最远建筑https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md
第 K 条最小指令https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md
二叉树的最近公共祖先 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md
Hopper 公司查询 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README.md
获取生成数组中的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md
字符频次唯一的最小删除次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md
销售价值减少的颜色球https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md
通过指令创建有序数组https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md
二叉树的最近公共祖先 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md
Hopper 公司查询 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md
拆炸弹https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md
使字符串平衡的最少删除次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md
到家的最少跳跃次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md
分配重复整数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md
设计有序流https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md
确定两个字符串是否接近https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md
将 x 减到 0 的最小操作数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md
最大化网格幸福感https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md
纠正二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md
每台机器的进程平均运行时间https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md
检查两个字符串数组是否相等https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md
具有给定数值的最小字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md
生成平衡数组的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md
完成所有任务的最少初始能量https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md
改变二叉树的根节点https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md
修复表中的名字https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md
最大重复子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md
合并两个链表https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md
设计前中后队列https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md
得到山形数组的最少删除次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md
最富有客户的资产总量https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md
找出最具竞争力的子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md
使数组互补的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md
数组的最小偏移量https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md
二叉树的最近公共祖先 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md
发票中的产品金额https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md
设计 Goal 解析器https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md
K 和数对的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md
连接连续二进制数字https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md
最小不兼容性https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1681.Minimum%20Incompatibility/README.md
最长回文子序列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md
无效的推文https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1683.Invalid%20Tweets/README.md
统计一致字符串的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md
有序数组中差绝对值之和https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md
石子游戏 VIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1686.Stone%20Game%20VI/README.md
从仓库到码头运输箱子https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md
比赛中的配对次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md
十-二进制数的最少数目https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md
石子游戏 VIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1690.Stone%20Game%20VII/README.md
堆叠长方体的最大高度https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md
计算分配糖果的不同方式https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md
每天的领导和合伙人https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md
重新格式化电话号码https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md
删除子数组的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md
跳跃游戏 VIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1696.Jump%20Game%20VI/README.md
检查边长度限制的路径是否存在https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md
字符串的不同子字符串个数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md
两人之间的通话次数https://github.com/gitbruce/leetcode2/blob/main/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md
无法吃午餐的学生数量https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md
平均等待时间https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1701.Average%20Waiting%20Time/README.md
修改后的最大二进制字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md
得到连续 K 个 1 的最少相邻交换次数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md
判断字符串的两半是否相似https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md
吃苹果的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md
球会落何处https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md
与数组中元素的最大异或值https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md
长度为 K 的最大子数组https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md
访问日期之间最大的空档期https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md
卡车上的最大单元数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md
大餐计数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1711.Count%20Good%20Meals/README.md
将数组分成三个子数组的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md
得到子序列的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md
数组中特殊等间距元素的和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md
苹果和橘子的个数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md
计算力扣银行的钱https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md
删除子字符串的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md
构建字典序最大的可行序列https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md
重构一棵树的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md
解码异或后的数组https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1720.Decode%20XORed%20Array/README.md
交换链表中的节点https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md
执行交换操作后的最小汉明距离https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md
完成所有工作的最短时间https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md
检查边长度限制的路径是否存在 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md
可以形成最大正方形的矩形数目https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md
同积元组https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md
重新排列后的最大子矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md
猫和老鼠 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md
求关注者的数量https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1729.Find%20Followers%20Count/README.md
获取食物的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md
每位经理的下属员工数量https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md
找到最高海拔https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md
需要教语言的最少人数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md
解码异或后的排列https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md
生成乘积数组的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md
替换隐藏数字得到的最晚时间https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md
满足三条件之一需改变的最少字符数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md
找出第 K 大的异或坐标值https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md
放置盒子https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1739.Building%20Boxes/README.md
找到二叉树中的距离https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md
查找每个员工花费的总时间https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md
盒子中小球的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md
从相邻元素对还原数组https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md
你能在你最喜欢的那天吃到你最喜欢的糖果吗?https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md
分割回文串 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md
经过一次操作后的最大子数组和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md
应该被禁止的 Leetflex 账户https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md
唯一元素的和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md
任意子数组和的绝对值的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md
删除字符串两端相同字符后的最短长度https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md
最多可以参加的会议数目 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md
检查数组是否经排序和轮转得到https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md
移除石子的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md
构造字典序最大的合并字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md
最接近目标值的子序列和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md
设计最近使用(MRU)队列https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md
可回收且低脂的产品https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md
生成交替二进制字符串的最少操作数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md
统计同质子字符串的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md
袋子里最少数目的球https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md
一个图中连通三元组的最小度数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md
能看到海景的建筑物https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md
最长的美好子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md
通过连接另一个数组的子数组得到一个数组https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md
地图中的最高点https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md
互质树https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md
寻找没有被执行的任务对https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md
交替合并字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md
移动所有球到每个盒子所需的最小操作数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md
执行乘法运算的最大分数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md
由子序列构造的最长回文串的长度https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md
按受欢迎程度排列功能https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md
统计匹配检索规则的物品数量https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md
最接近目标价格的甜点成本https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md
通过最少操作次数使数组的和相等https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md
车队 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1776.Car%20Fleet%20II/README.md
每家商店的产品价格https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md
未知网格中的最短路径https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md
找到最近的有相同 X 或 Y 坐标的点https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md
判断一个数字是否可以表示成三的幂的和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md
所有子字符串美丽值之和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md
统计点对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md
大满贯数量https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md
检查二进制字符串字段https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md
构成特定和需要添加的最少元素https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md
从第一个节点出发到最后一个节点的受限路径数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md
使所有区间的异或结果为零https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md
最大化花园的美观度https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md
员工的直属部门https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README.md
仅执行一次字符串交换能否使两个字符串相等https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md
找出星型图的中心节点https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md
最大平均通过率https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md
好子数组的最大分数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md
统计距离最小的子串对个数https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md
每个产品在不同商店的价格https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1795.Rearrange%20Products%20Table/README.md
字符串中第二大的数字https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md
设计一个验证系统https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md
你能构造出连续值的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md
N 次操作后的最大分数和https://github.com/gitbruce/leetcode2/blob/main/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md
最大升序子数组和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md
积压订单中的订单总数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md
有界数组中指定下标处的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md
统计异或值在范围内的数对有多少https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md
实现 Trie (前缀树) IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md
字符串中不同整数的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md
还原排列的最少操作步数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md
替换字符串中的括号内容https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md
好因子的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md
没有广告的剧集https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1809.Ad-Free%20Sessions/README.md
隐藏网格下的最小消耗路径https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md
寻找面试候选人https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md
判断国际象棋棋盘中一个格子的颜色https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md
句子相似性 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md
统计一个数组中好对子的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md
得到新鲜甜甜圈的最多组数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md
截断句子https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1816.Truncate%20Sentence/README.md
查找用户活跃分钟数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md
绝对差值和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md
序列中不同最大公约数的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md
最多邀请的个数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md
寻找今年具有正收入的客户https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md
数组元素积的符号https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md
找出游戏的获胜者https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md
最少侧跳次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md
求出 MK 平均值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1825.Finding%20MK%20Average/README.md
有缺陷的传感器https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1826.Faulty%20Sensor/README.md
最少操作使数组递增https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md
统计一个圆中点的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md
每个查询的最大异或值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md
使字符串有序的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md
每天的最大交易https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md
判断句子是否为全字母句https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md
雪糕的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md
单线程 CPUhttps://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1834.Single-Threaded%20CPU/README.md
所有数对按位与结果的异或和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md
从未排序的链表中移除重复元素https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md
K 进制表示下的各位数字总和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md
最高频元素的频数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md
所有元音按顺序排布的最长子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md
最高建筑高度https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1840.Maximum%20Building%20Height/README.md
联赛信息统计https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1841.League%20Statistics/README.md
下个由相同数字构成的回文串https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md
可疑银行账户https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md
将所有数字用字符替换https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md
座位预约管理系统https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md
减小和重新排列数组后的最大元素https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md
最近的房间https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1847.Closest%20Room/README.md
到目标元素的最小距离https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md
将字符串拆分为递减的连续值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md
邻位交换的最小次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md
包含每个查询的最小区间https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md
每个子数组的数字种类数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md
转换日期格式https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1853.Convert%20Date%20Format/README.md
人口最多的年份https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1854.Maximum%20Population%20Year/README.md
下标对中的最大距离https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md
子数组最小乘积的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md
有向图中最大颜色值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md
包含所有前缀的最长单词https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md
将句子排序https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md
增长的内存泄露https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md
旋转盒子https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1861.Rotating%20the%20Box/README.md
向下取整数对和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md
找出所有子集的异或总和再求和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md
构成交替字符串需要的最小交换次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md
找出和为指定值的下标对https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md
恰有 K 根木棍可以看到的排列数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md
最大数量高于平均水平的订单https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md
两个行程编码数组的积https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md
哪种连续子字符串更长https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md
准时到达的列车最小时速https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md
跳跃游戏 VIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1871.Jump%20Game%20VII/README.md
石子游戏 VIIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1872.Stone%20Game%20VIII/README.md
计算特殊奖金https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md
两个数组的最小乘积和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md
将工资相同的雇员分组https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md
长度为三且各字符不同的子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md
数组中最大数对和的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md
矩阵中最大的三个菱形和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md
两个数组最小的异或值之和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md
检查某单词是否等于两单词之和https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md
插入后的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md
使用服务器处理任务https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md
准时抵达会议现场的最小跳过休息次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md
鸡蛋掉落-两枚鸡蛋https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md
统计数对https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md
判断矩阵经轮转后是否一致https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md
使数组元素相等的减少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md
使二进制字符串字符交替的最少反转次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md
装包裹的最小浪费空间https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md
2020年最后一次登录https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md
割绳子https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1891.Cutting%20Ribbons/README.md
页面推荐Ⅱhttps://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1892.Page%20Recommendations%20II/README.md
检查是否区域内所有整数都被覆盖https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md
找到需要补充粉笔的学生编号https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md
最大的幻方https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1895.Largest%20Magic%20Square/README.md
反转表达式值的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md
重新分配字符使所有字符串都相等https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md
可移除字符的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md
合并若干三元组以形成目标三元组https://github.com/gitbruce/leetcode2/blob/main/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md
最佳运动员的比拼回合https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md
寻找峰值 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README.md
给定二叉搜索树的插入顺序求深度https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md
字符串中的最大奇数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md
你完成的完整对局数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md
统计子岛屿https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1905.Count%20Sub%20Islands/README.md
查询差绝对值的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md
按分类统计薪水https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1907.Count%20Salary%20Categories/README.md
Nim 游戏 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1908.Game%20of%20Nim/README.md
删除一个元素使数组严格递增https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md
删除一个字符串中所有出现的给定子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md
最大子序列交替和https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md
设计电影租借系统https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md
两个数对之间的最大乘积差https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md
循环轮转矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md
最美子字符串的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md
统计为蚁群构筑房间的不同顺序https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md
Leetcodify 好友推荐https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md
第 K 小的子数组和·https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md
兴趣相同的朋友https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md
基于排列构建数组https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md
消灭怪物的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md
统计好数字的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1922.Count%20Good%20Numbers/README.md
最长公共子路径https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md
安装栅栏 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md
统计平方和三元组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md
迷宫中离入口最近的出口https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md
求和游戏https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1927.Sum%20Game/README.md
规定时间内到达终点的最小花费https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md
数组串联https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1929.Concatenation%20of%20Array/README.md
长度为 3 的不同回文子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md
用三种不同颜色为网格涂色https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md
合并多棵二叉搜索树https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md
判断字符串是否可分解为值均等的子串https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md
确认率https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1934.Confirmation%20Rate/README.md
可以输入的最大单词数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md
新增的最少台阶数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md
扣分后的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md
查询最大基因差https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md
主动请求确认消息的用户https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md
排序数组之间的最长公共子序列https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md
检查是否所有字符出现次数相同https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md
最小未被占据椅子的编号https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md
描述绘画结果https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1943.Describe%20the%20Painting/README.md
队列中可以看到的人数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md
字符串转化后的各位数字之和https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md
子字符串突变后可能得到的最大整数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md
最大兼容性评分和https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md
删除系统中的重复文件夹https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md
坚定的友谊https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1949.Strong%20Friendship/README.md
所有子数组最小值中的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md
查询具有最多共同关注者的所有两两结对组https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md
三除数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1952.Three%20Divisors/README.md
你可以工作的最大周数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md
收集足够苹果的最小花园周长https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md
统计特殊子序列的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md
感染 K 种病毒所需的最短时间https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md
删除字符使字符串变好https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md
检查操作是否合法https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md
K 次调整数组大小浪费的最小总空间https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md
两个回文子字符串长度的最大乘积https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md
检查字符串是否为数组前缀https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md
移除石子使总数最小https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md
使字符串平衡的最小交换次数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md
找出到每个位置为止最长的有效障碍赛跑路线https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md
丢失信息的雇员https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README.md
未排序数组中的可被二分搜索的数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md
作为子字符串出现在单词中的字符串数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md
构造元素不等于两相邻元素平均值的数组https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md
数组元素的最小非零乘积https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md
你能穿过矩阵的最后一天https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md
寻找图中是否存在路径https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README.md
同一天的第一个电话和最后一个电话https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md
值等于子节点值之和的节点数量https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md
使用特殊打字机键入单词的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md
最大方阵和https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md
到达目的地的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md
划分数字的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md
上级经理已离职的公司员工https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README.md
找出数组的最大公约数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md
找出不同的二进制字符串https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md
最小化目标值与所选元素的差https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md
从子集的和还原数组https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md
范围和相等的最宽索引对https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md
学生分数的最小差值https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md
找出数组中的第 K 大整数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md
完成任务的最少工作时间段https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md
不同的好子序列数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md
找出每所学校的最低分数要求https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md
捉迷藏中可捕获的最大人数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README.md
统计实验的数量https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md
找到数组的中间位置https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md
找到所有的农场组https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md
树上的操作https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1993.Operations%20on%20Tree/README.md
好子集的数目https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md
统计特殊四元组https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md
游戏中弱角色的数量https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md
访问完所有房间的第一天https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md
数组的最大公因数排序https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md
最小的仅由两个数组成的倍数https://github.com/gitbruce/leetcode2/blob/main/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md
反转单词前缀https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md
可互换矩形的组数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md
两个回文子序列长度的最大乘积https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md
每棵子树内缺失的最小基因值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md
职员招聘人数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md
斐波那契树的移除子树游戏https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md
差的绝对值为 K 的数对数目https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md
从双倍数组中还原原数组https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md
出租车的最大盈利https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md
使数组连续的最少操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md
职员招聘人数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md
执行操作后的变量值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md
数组美丽值求和https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md
检测正方形https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2013.Detect%20Squares/README.md
重复 K 次的最长子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md
每段建筑物的平均高度https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md
增量元素之间的最大差值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md
网格游戏https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2017.Grid%20Game/README.md
判断单词是否能放入填字游戏内https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md
解出数学表达式的学生分数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md
无流量的帐户数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README.md
街上最亮的位置https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README.md
将一维数组转变成二维数组https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md
连接后等于目标字符串的字符串对https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md
考试的最大困扰度https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md
分割数组的最多方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md
低质量的问题https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2026.Low-Quality%20Problems/README.md
转换字符串的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md
找出缺失的观测数据https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2028.Find%20Missing%20Observations/README.md
石子游戏 IXhttps://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2029.Stone%20Game%20IX/README.md
含特定字母的最小子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md
1 比 0 多的子数组个数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README.md
至少在两个数组中出现的值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md
获取单值网格的最小操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md
股票价格波动https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md
将数组分成两个数组并最小化数组和的差https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md
最大交替子数组和https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README.md
使每位学生都有座位的最少移动次数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md
如果相邻两个颜色均相同则删除当前颜色https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md
网络空闲的时刻https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md
两个有序数组的第 K 小乘积https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md
面试中被录取的候选人https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README.md
检查句子中的数字是否递增https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md
简易银行系统https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2043.Simple%20Bank%20System/README.md
统计按位或能得到最大值的子集数目https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md
到达目的地的第二短时间https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md
给按照绝对值排序的链表排序https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README.md
句子中的有效单词数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md
下一个更大的数值平衡数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md
统计最高分的节点数目https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md
并行课程 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2050.Parallel%20Courses%20III/README.md
商店中每个成员的级别https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README.md
将句子分隔成行的最低成本https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README.md
数组中第 K 个独一无二的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md
两个最好的不重叠活动https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md
蜡烛之间的盘子https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2055.Plates%20Between%20Candles/README.md
棋盘上有效移动组合的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md
值相等的最小索引https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md
找出临界点之间的最小和最大距离https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md
转化数字的最小运算数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md
同源字符串检测https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md
扫地机器人清扫过的空间个数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README.md
统计字符串中的元音子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md
所有子字符串中的元音https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md
分配给商店的最多商品的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md
最大化一张图中的路径价值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md
账户余额https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2066.Account%20Balance/README.md
等计数子串的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README.md
检查两个字符串是否几乎相等https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md
模拟行走机器人 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md
每一个查询的最大美丽值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md
你可以安排的最多任务数目https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md
赢得比赛的大学https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2072.The%20Winner%20University/README.md
买票需要的时间https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md
反转偶数长度组的节点https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md
解码斜向换位密码https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md
处理含限制条件的好友请求https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md
殊途同归https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README.md
两栋颜色不同且距离最远的房子https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md
给植物浇水https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2079.Watering%20Plants/README.md
区间内查询数字的频率https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md
k 镜像数字的和https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md
富有客户的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README.md
求以相同字母开头和结尾的子串总数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README.md
为订单类型为 0 的客户删除类型为 1 的订单https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README.md
统计出现过一次的公共字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md
从房屋收集雨水需要的最少水桶数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README.md
网格图中机器人回家的最小代价https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md
统计农场中肥沃金字塔的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md
找出数组排序后的目标下标https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md
半径为 k 的子数组平均值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md
从数组中移除最大值和最小值https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md
找出知晓秘密的所有专家https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md
前往目标城市的最小费用https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README.md
找出 3 位偶数https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md
删除链表的中间节点https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md
从二叉树一个节点到另一个节点每一步的方向https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md
合法重新排列数对https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md
长度为 K 的最大偶数和子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README.md
找到和最大的长度为 K 的子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md
适合野炊的日子https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md
引爆最多的炸弹https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md
序列顺序查询https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md
环和杆https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2103.Rings%20and%20Rods/README.md
子数组范围和https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md
给植物浇水 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2105.Watering%20Plants%20II/README.md
摘水果https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md
分享 K 个糖果后独特口味的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README.md
找出数组中的第一个回文字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md
向字符串添加空格https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md
股票平滑下跌阶段的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md
使数组 K 递增的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md
最繁忙的机场https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README.md
查询删除和添加元素后的数组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md
句子中的最多单词数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md
从给定原材料中找到所有可以做出的菜https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md
判断一个括号字符串是否有效https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md
一个区间内所有数乘积的缩写https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md
建立方程https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2118.Build%20the%20Equation/README.md
反转两次的数字https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md
执行所有后缀指令https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md
相同元素的间隔之和https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md
还原原数组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md
使矩阵中的 1 互不相邻的最小操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README.md
检查是否所有 A 都在 B 之前https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md
银行中的激光束数量https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md
摧毁小行星https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2126.Destroying%20Asteroids/README.md
参加会议的最多员工数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md
通过翻转行或列来去除所有的 1https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md
将标题首字母大写https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2129.Capitalize%20the%20Title/README.md
链表最大孪生和https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md
连接两字母单词得到的最长回文串https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md
用邮票贴满网格图https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2132.Stamping%20the%20Grid/README.md
检查是否每一行每一列都包含全部整数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md
最少交换次数来组合所有的 1 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md
统计追加字母可以获得的单词数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md
全部开花的最早一天https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md
通过倒水操作让所有的水桶所含水量相等https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README.md
将字符串拆分为若干长度为 k 的组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md
得到目标值的最少行动次数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md
解决智力问题https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md
同时运行 N 台电脑的最长时间https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md
每辆车的乘客人数 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README.md
在两个数组的区间中选取数字https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README.md
打折购买糖果的最小开销https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md
统计隐藏数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md
价格范围内最高排名的 K 样物品https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md
分隔长廊的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md
元素计数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md
按符号重排数组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md
找出数组中的所有孤独数字https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md
基于陈述统计最多好人数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md
穿过所有点的所需最少直线数量https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README.md
每辆车的乘客人数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README.md
将找到的值乘以 2https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md
分组得分最高的所有下标https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md
查找给定哈希值的子串https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md
字符串分组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2157.Groups%20of%20Strings/README.md
每天绘制新区域的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md
分别排序两列https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README.md
拆分数位后四位数字的最小和https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md
根据给定数字划分数组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md
设置时间的最少代价https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md
删除元素后和的最小差值https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md
对奇偶下标分别排序https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md
重排数字的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md
设计位集https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2166.Design%20Bitset/README.md
移除所有载有违禁货物车厢所需的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md
每个数字的频率都相同的独特子字符串的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README.md
得到 0 的操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md
使数组变成交替数组的最少操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md
拿出最少数目的魔法豆https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md
数组的最大与和https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md
最多连胜的次数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2173.Longest%20Winning%20Streak/README.md
通过翻转行或列来去除所有的 1 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README.md
世界排名的变化https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README.md
统计数组中相等且可以被整除的数对https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md
找到和为给定整数的三个连续整数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md
拆分成最多数目的正偶数之和https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md
统计数组中好三元组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md
统计各位数字之和为偶数的整数个数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md
合并零之间的节点https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md
构造限制重复的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md
统计可以被 K 整除的下标对数目https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md
建造坚实的砖墙的方法数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README.md
统计包含给定前缀的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md
制造字母异位词的最小步骤数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md
完成旅途的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md
完成比赛的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md
建造纸牌屋的方法数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README.md
数组中紧跟 key 之后出现最频繁的数字https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md
将杂乱无章的数字排序https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md
有向无环图中一个节点的所有祖先https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md
得到回文串的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md
Excel 表中某个范围内的单元格https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md
向数组中追加 K 个整数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md
根据描述创建二叉树https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md
替换数组中的非互质数https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md
单因数三元组https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README.md
找到每篇文章的主题https://github.com/gitbruce/leetcode2/blob/main/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README.md
找出数组中的所有 K 近邻下标https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md
统计可以提取的工件https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md
K 次操作后最大化顶端元素https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md
得到要求路径的最小带权子图https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md
无向图中到环的距离https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md
有资格享受折扣的用户数量https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README.md
将数组划分成相等数对https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md
字符串中最多数目的子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md
将数组和减半的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md
用地毯覆盖后的最少白色砖块https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md
统计数组中峰和谷的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md
统计道路上的碰撞次数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md
射箭比赛中的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md
由单个字符重复的最长子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md
通关游戏所需的最低生命值https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README.md
找出两数组的不同https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md
美化数组的最少删除数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md
找到指定长度的回文数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md
从栈中取出 K 个硬币的最大面值和https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md
数组的最大总分https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README.md
转换数字的最少位翻转次数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md
数组的三角和https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md
选择建筑的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md
构造字符串的总得分和https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md
转化时间需要的最少操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md
找出输掉零场或一场比赛的玩家https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md
每个小孩最多能分到多少糖果https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md
加密解密字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md
7 天内两次购买的用户https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md
检查数组是否连贯https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md
查找可享受优惠的用户https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md
按奇偶性交换后的最大数字https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md
向表达式添加括号后的最小结果https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md
K 次增加后的最大乘积https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md
花园的最大总美丽值https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md
两整数相加https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2235.Add%20Two%20Integers/README.md
判断根结点是否等于子结点之和https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md
计算街道上满足所需亮度的位置数量https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README.md
司机成为乘客的次数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README.md
找到最接近 0 的数字https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README.md
买钢笔和铅笔的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README.md
设计一个 ATM 机器https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README.md
节点序列的最大得分https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README.md
计算字符串的数字和https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README.md
完成所有任务需要的最少轮数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README.md
转角路径的乘积中最多能有几个尾随零https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README.md
相邻字符不同的最长路径https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README.md
K 条高速公路的最大旅行费用https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README.md
多个数组求交集https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README.md
统计圆内格点数目https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README.md
统计包含每个点的矩形数目https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README.md
花期内花的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README.md
表的动态旋转https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README.md
动态取消表的旋转https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README.md
设计视频共享平台https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README.md
统计是给定字符串前缀的字符串数目https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README.md
最小平均差https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2256.Minimum%20Average%20Difference/README.md
统计网格图中没有被保卫的格子数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README.md
逃离火灾https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README.md
移除指定数字得到的最大结果https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README.md
必须拿起的最小连续卡牌数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README.md
含最多 K 个可整除元素的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README.md
字符串的总引力https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README.md
数组变为有序的最小操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README.md
字符串中最大的 3 位相同数字https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README.md
统计值等于子树平均值的节点数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README.md
统计打字方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2266.Count%20Number%20of%20Texts/README.md
检查是否有合法括号字符串路径https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README.md
最少按键次数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README.md
找到一个数字的 K 美丽值https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README.md
分割数组的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README.md
毯子覆盖的最多白色砖块数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README.md
最大波动的子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README.md
移除字母异位词后的结果数组https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README.md
不含特殊楼层的最大连续楼层数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README.md
按位与结果大于零的最长组合https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README.md
统计区间中的整数数目https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README.md
树中最接近路径的节点https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README.md
字母在字符串中的百分比https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README.md
装满石头的背包的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README.md
表示一个折线图的最少线段数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README.md
巫师的总力量和https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README.md
在一个网格中可以看到的人数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README.md
判断一个数的数字计数是否等于数位的值https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README.md
最多单词数的发件人https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README.md
道路的最大总重要性https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README.md
以组为单位订音乐会的门票https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README.md
重排字符形成目标字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README.md
价格减免https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README.md
使数组按非递减顺序排列https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README.md
到达角落需要移除障碍物的最小数目https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md
最大股票收益https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README.md
连续两年有 3 个及以上订单的产品https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README.md
极大极小游戏https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2293.Min%20Max%20Game/README.md
划分数组使最大差为 Khttps://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README.md
替换数组中的元素https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README.md
设计一个文本编辑器https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2296.Design%20a%20Text%20Editor/README.md
跳跃游戏 VIIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2297.Jump%20Game%20VIII/README.md
周末任务计数https://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README.md
强密码检验器 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README.md
咒语和药水的成功对数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README.md
替换字符后匹配https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README.md
统计得分小于 K 的子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README.md
计算应缴税款总额https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README.md
网格中的最小路径代价https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README.md
公平分发饼干https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md
公司命名https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2306.Naming%20a%20Company/README.md
检查方程中的矛盾之处https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README.md
按性别排列表格https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README.md
兼具大小写的最好英文字母https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README.md
个位数字为 K 的整数之和https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README.md
小于等于 K 的最长二进制子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README.md
卖木头块https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md
二叉树中得到结果所需的最少翻转次数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README.md
每个城市最高气温的第一天https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README.md
统计星号https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2315.Count%20Asterisks/README.md
统计无向图中无法互相到达点对数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README.md
操作后的最大异或和https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README.md
不同骰子序列的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README.md
判断矩阵是否是一个 X 矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README.md
统计放置房子的方式数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README.md
拼接数组的最大分数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README.md
从树中删除边的最小分数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README.md
完成所有工作的最短时间 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README.md
产品销售分析 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README.md
解密消息https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2325.Decode%20the%20Message/README.md
螺旋矩阵 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2326.Spiral%20Matrix%20IV/README.md
知道秘密的人数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README.md
网格图中递增路径的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md
产品销售分析Ⅴhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README.md
验证回文串 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2330.Valid%20Palindrome%20IV/README.md
计算布尔二叉树的值https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README.md
坐上公交的最晚时间https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README.md
最小差值平方和https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README.md
元素值大于变化阈值的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md
装满杯子需要的最短总时长https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README.md
无限集中的最小数字https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README.md
移动片段得到字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md
统计理想数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README.md
联赛的所有比赛https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README.md
生成有效数组的最少交换次数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README.md
数组能形成多少数对https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README.md
数位和相等数对的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README.md
裁剪数字后查询第 K 小的数字https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README.md
使数组可以被整除的最少删除次数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README.md
寻找可见山的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README.md
以百分比计算排名https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README.md
最好的扑克手牌https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2347.Best%20Poker%20Hand/README.md
全 0 子数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md
设计数字容器系统https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README.md
不可能得到的最短骰子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README.md
第一个出现两次的字母https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README.md
相等行列对https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README.md
设计食物评分系统https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README.md
优质数对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README.md
你能拿走的最大图书数量https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README.md
每位教师所教授的科目种类的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README.md
使数组中所有元素都等于零https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README.md
分组的最大数量https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README.md
找到离给定两个节点最近的节点https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README.md
图中的最长环https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md
乘坐火车路线的最少费用https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README.md
生成发票https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2362.Generate%20the%20Invoice/README.md
合并相似的物品https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2363.Merge%20Similar%20Items/README.md
统计坏数对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README.md
任务调度器 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2365.Task%20Scheduler%20II/README.md
将数组排序的最少替换次数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README.md
算术三元组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README.md
受限条件下可到达节点的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README.md
检查数组是否存在有效划分https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README.md
最长理想子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README.md
最小化网格中的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README.md
计算每个销售人员的影响力https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README.md
矩阵中的局部最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README.md
边积分最高的节点https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README.md
根据模式串构造最小数字https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README.md
统计特殊整数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2376.Count%20Special%20Integers/README.md
整理奥运表https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README.md
选择边来最大化树的得分https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README.md
得到 K 个黑块的最少涂色次数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README.md
二进制字符串重新安排顺序需要的时间https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README.md
字母移位 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2381.Shifting%20Letters%20II/README.md
删除操作后的最大子段和https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README.md
赢得比赛需要的最少训练时长https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README.md
最大回文数字https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2384.Largest%20Palindromic%20Number/README.md
感染二叉树需要的总时间https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README.md
找出数组的第 K 大和https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README.md
行排序矩阵的中位数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README.md
将表中的空值更改为前一个值https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README.md
和有限的最长子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README.md
从字符串中移除星号https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README.md
收集垃圾的最少总时间https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README.md
给定条件下构造矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README.md
严格递增的子数组个数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README.md
开除员工https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2394.Employees%20With%20Deductions/README.md
和相等的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README.md
严格回文的数字https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README.md
被列覆盖的最多行数https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README.md
预算内的最多机器人数目https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README.md
检查相同字母间的距离https://github.com/gitbruce/leetcode2/blob/main/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README.md
恰好移动 k 步到达某一位置的方法数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README.md
最长优雅子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2401.Longest%20Nice%20Subarray/README.md
会议室 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md
杀死所有怪物的最短时间https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README.md
出现最频繁的偶数元素https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README.md
子字符串的最优划分https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README.md
将区间分为最少组数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README.md
最长递增子序列 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README.md
设计 SQLhttps://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2408.Design%20SQL/README.md
统计共同度过的日子数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README.md
运动员和训练师的最大匹配数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README.md
按位或最大的最小子数组长度https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README.md
完成所有交易的初始最少钱数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README.md
最小偶倍数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2413.Smallest%20Even%20Multiple/README.md
最长的字母序连续子字符串的长度https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README.md
反转二叉树的奇数层https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README.md
字符串的前缀分数和https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README.md
最近的公平整数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2417.Closest%20Fair%20Integer/README.md
按身高排序https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2418.Sort%20the%20People/README.md
按位与最大的最长子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README.md
找到所有好下标https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2420.Find%20All%20Good%20Indices/README.md
好路径的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2421.Number%20of%20Good%20Paths/README.md
使用合并操作将数组转换为回文序列https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README.md
删除字符使频率相同https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README.md
最长上传前缀https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README.md
所有数对的异或和https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README.md
满足不等式的数对数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README.md
公因子的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2427.Number%20of%20Common%20Factors/README.md
沙漏的最大总和https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README.md
最小异或https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2429.Minimize%20XOR/README.md
对字母串可执行的最大删除数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README.md
最大限度地提高购买水果的口味https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README.md
处理用时最长的那个任务的员工https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README.md
找出前缀异或的原始数组https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README.md
使用机器人打印字典序最小的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README.md
矩阵中和能被 K 整除的路径https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README.md
使子数组最大公约数大于一的最小分割数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README.md
有效时间的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README.md
二的幂数组中查询范围内的乘积https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README.md
最小化数组中的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README.md
创建价值相同的连通块https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README.md
与对应负数同时存在的最大正整数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README.md
反转之后不同整数的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README.md
反转之后的数字和https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README.md
统计定界子数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README.md
值为 1 的节点数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README.md
判断两个事件是否存在冲突https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README.md
最大公因数等于 K 的子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README.md
使数组相等的最小开销https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md
使数组相似的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README.md
应用操作后不同二进制字符串的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README.md
差值数组不同的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2451.Odd%20String%20Difference/README.md
距离字典两次编辑以内的单词https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README.md
摧毁一系列目标https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README.md
下一个更大元素 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README.md
可被三整除的偶数的平均值https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README.md
最流行的视频创作者https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README.md
美丽整数的最小增量https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README.md
移除子树后的二叉树高度https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README.md
通过移动项目到空白区域来排序数组https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README.md
对数组执行操作https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README.md
长度为 K 子数组中的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README.md
雇佣 K 位工人的总代价https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README.md
最小移动总距离https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README.md
有效分割中的最少子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README.md
不同的平均值数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README.md
统计构造好字符串的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README.md
树上最大得分和路径https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README.md
根据限制分割消息https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README.md
温度转换https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2469.Convert%20the%20Temperature/README.md
最小公倍数为 K 的子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md
逐层排序二叉树所需的最少操作数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md
不重叠回文子字符串的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md
购买苹果的最低成本https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README.md
购买量严格增加的客户https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README.md
数组中不等三元组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README.md
二叉搜索树最近节点查询https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README.md
到达首都的最少油耗https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README.md
完美分割的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README.md
两个不重叠子树的最大异或值https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README.md
形成化学键https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README.md
分割圆的最少切割次数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README.md
行和列中一和零的差值https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README.md
商店的最少代价https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README.md
统计回文子序列数目https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README.md
找出中枢整数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README.md
追加字符以获得子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README.md
从链表中移除节点https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README.md
统计中位数为 K 的子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README.md
固定比率的子字符串数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README.md
回环句https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2490.Circular%20Sentence/README.md
划分技能点相等的团队https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README.md
两个城市间路径的最小分数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README.md
将节点分成尽可能多的组https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README.md
合并在同一个大厅重叠的活动https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README.md
乘积为偶数的子数组数https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README.md
数组中字符串的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README.md
图中最大星和https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README.md
青蛙过河 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2498.Frog%20Jump%20II/README.md
让数组不相等的最小总代价https://github.com/gitbruce/leetcode2/blob/main/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README.md
删除每行中的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README.md
数组中最长的方波https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README.md
设计内存分配器https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2502.Design%20Memory%20Allocator/README.md
矩阵查询可获得的最大分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README.md
把名字和职业联系起来https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README.md
所有子序列和的按位或https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README.md
统计相似字符串对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README.md
使用质因数之和替换后可以取到的最小值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README.md
添加边使所有节点度数都为偶数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README.md
查询树中环的长度https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README.md
检查是否有路径经过相同数量的 0 和 1https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README.md
最多可以摧毁的敌人城堡数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README.md
奖励最顶尖的 K 名学生https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2512.Reward%20Top%20K%20Students/README.md
最小化两个数组中的最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README.md
统计同位异构字符串数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2514.Count%20Anagrams/README.md
到目标字符串的最短距离https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README.md
每种字符至少取 K 个https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README.md
礼盒的最大甜蜜度https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md
好分区的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README.md
统计 K-Big 索引的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README.md
统计能整除数字的位数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README.md
数组乘积中的不同质因数数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README.md
将字符串分割成值不超过 K 的子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README.md
范围内最接近的两个质数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README.md
子数组的最大频率分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README.md
根据规则将箱子分类https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README.md
找到数据流中的连续整数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README.md
查询数组异或美丽值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README.md
最大化城市的最小电量https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README.md
正整数和负整数的最大计数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README.md
执行 K 次操作后的最大分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README.md
使字符串中不同字符的数目相等https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README.md
过桥的时间https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README.md
好二进制字符串的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README.md
通过门的时间https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README.md
数组元素和与数字和的绝对差https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README.md
子矩阵元素加 1https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README.md
统计好子数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README.md
最大价值和与最小价值和的差值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README.md
好子序列的个数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README.md
最小公共值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2540.Minimum%20Common%20Value/README.md
使数组中所有元素相等的最小操作数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README.md
最大子序列的分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README.md
判断一个点是否可以到达https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README.md
交替数字和https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2544.Alternating%20Digit%20Sum/README.md
根据第 K 场考试的分数排序https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README.md
执行逐位运算使字符串相等https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README.md
拆分数组的最小代价https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README.md
填满背包的最大价格https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README.md
统计桌面上的不同数字https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README.md
猴子碰撞的方法数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README.md
将珠子放入背包中https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README.md
统计上升四元组https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README.md
分割数组中数字的数位https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README.md
从一个范围内选择最多整数 Ihttps://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README.md
两个线段获得的最多奖品https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README.md
二进制矩阵中翻转最多一次使路径不连通https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README.md
从一个范围内选择最多整数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md
从数量最多的堆取走礼物https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README.md
统计范围内的元音字符串数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README.md
打家劫舍 IVhttps://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2560.House%20Robber%20IV/README.md
重排水果https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2561.Rearranging%20Fruits/README.md
找出数组的串联值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README.md
统计公平数对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README.md
子字符串异或查询https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2564.Substring%20XOR%20Queries/README.md
最少得分子序列https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README.md
替换一个数字后的最大差值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README.md
修改两个元素的最小分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md
最小无法得到的或值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2568.Minimum%20Impossible%20OR/README.md
更新数组后处理求和查询https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README.md
合并两个二维数组 - 求和法https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README.md
将整数减少到零需要的最少操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README.md
无平方子集计数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md
找出对应 LCP 矩阵的字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README.md
左右元素和的差值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md
找出字符串的可整除数组https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README.md
求出最多标记下标https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README.md
在网格图中访问一个格子的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README.md
最小和分割https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README.md
统计染色格子数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README.md
统计将重叠区间合并成组的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README.md
统计可能的树根数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md
递枕头https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2582.Pass%20the%20Pillow/README.md
二叉树中的第 K 大层和https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README.md
分割数组使乘积互质https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README.md
获得分数的方法数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README.md
统计范围内的元音字符串数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README.md
重排数组以得到最大前缀分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README.md
统计美丽子数组数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README.md
完成所有任务的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README.md
设计一个待办事项清单https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2590.Design%20a%20Todo%20List/README.md
将钱分给最多的儿童https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README.md
最大化数组的伟大值https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README.md
标记所有元素后数组的分数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README.md
修车的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README.md
奇偶位数https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README.md
检查骑士巡视方案https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README.md
美丽子集的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README.md
执行操作后的最大 MEXhttps://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README.md
使前缀和数组非负https://github.com/gitbruce/leetcode2/blob/main/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README.md
K 件物品的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README.md
质数减法运算https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README.md
使数组元素全部相等的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README.md
收集树中金币https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md
吃掉所有谷子的最短时间https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README.md
从两个数字数组里生成最小数字https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README.md
找到最大开销的子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README.md
使子数组元素和相等https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README.md
图中的最短环https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README.md
最长平衡子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README.md
转换二维数组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README.md
老鼠和奶酪https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2611.Mice%20and%20Cheese/README.md
最少翻转操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README.md
美数对https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2613.Beautiful%20Pairs/README.md
对角线上的质数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2614.Prime%20In%20Diagonal/README.md
等值距离和https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2615.Sum%20of%20Distances/README.md
最小化数对的最大差值https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README.md
网格图中最少访问的格子数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README.md
检查是否是类的对象实例https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2618.Check%20if%20Object%20Instance%20of%20Class/README.md
数组原型对象的最后一个元素https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2619.Array%20Prototype%20Last/README.md
计数器https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2620.Counter/README.md
睡眠函数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2621.Sleep/README.md
有时间限制的缓存https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2622.Cache%20With%20Time%20Limit/README.md
记忆函数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2623.Memoize/README.md
蜗牛排序https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2624.Snail%20Traversal/README.md
扁平化嵌套数组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2625.Flatten%20Deeply%20Nested%20Array/README.md
数组归约运算https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2626.Array%20Reduce%20Transformation/README.md
函数防抖https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2627.Debounce/README.md
完全相等的 JSON 字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2628.JSON%20Deep%20Equal/README.md
复合函数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2629.Function%20Composition/README.md
记忆函数 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2630.Memoize%20II/README.md
分组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2631.Group%20By/README.md
柯里化https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2632.Curry/README.md
将对象转换为 JSON 字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README.md
过滤数组中的元素https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README.md
转换数组中的每个元素https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README.md
Promise 对象池https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2636.Promise%20Pool/README.md
有时间限制的 Promise 对象https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2637.Promise%20Time%20Limit/README.md
统计 K-Free 子集的总数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README.md
查询网格图中每一列的宽度https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README.md
一个数组所有前缀的分数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README.md
二叉树的堂兄弟节点 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README.md
设计可以求最短路径的图类https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README.md
一最多的行https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README.md
找出可整除性得分最大的整数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README.md
构造有效字符串的最少插入数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README.md
最小化旅行的价格总和https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README.md
把三角形染成红色https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README.md
生成斐波那契数列https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README.md
嵌套数组生成器https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2649.Nested%20Array%20Generator/README.md
设计可取消函数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2650.Design%20Cancellable%20Function/README.md
计算列车到站时间https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README.md
倍数求和https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2652.Sum%20Multiples/README.md
滑动子数组的美丽值https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README.md
使数组所有元素变成 1 的最少操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README.md
寻找最大长度的未覆盖区间https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README.md
K 个元素的最大和https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README.md
找到两个数组的前缀公共数组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README.md
网格图中鱼的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README.md
将数组清空https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2659.Make%20Array%20Empty/README.md
保龄球游戏的获胜者https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README.md
找出叠涂元素https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README.md
前往目标的最小代价https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README.md
字典序最小的美丽字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README.md
巡逻的骑士https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README.md
计数器 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2665.Counter%20II/README.md
只允许一次函数调用https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2666.Allow%20One%20Function%20Call/README.md
创建 Hello World 函数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2667.Create%20Hello%20World%20Function/README.md
查询员工当前薪水https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2668.Find%20Latest%20Salaries/README.md
统计 Spotify 排行榜上艺术家出现次数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README.md
找出不同元素数目差数组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README.md
频率跟踪器https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2671.Frequency%20Tracker/README.md
有相同颜色的相邻元素数目https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README.md
使二叉树所有路径值相等的最小代价https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README.md
拆分循环链表https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README.md
将对象数组转换为矩阵https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README.md
节流https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2676.Throttle/README.md
分块数组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2677.Chunk%20Array/README.md
老人的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README.md
矩阵中的和https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README.md
最大或值https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2680.Maximum%20OR/README.md
英雄的力量https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2681.Power%20of%20Heroes/README.md
找出转圈游戏输家https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README.md
相邻值的按位异或https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README.md
矩阵中移动的最大次数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README.md
统计完全连通分量的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README.md
即时食物配送 IIIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README.md
自行车的最后使用时间https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README.md
查找活跃用户https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2688.Find%20Active%20Users/README.md
从 Rope 树中提取第 K 个字符https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README.md
无穷方法对象https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2690.Infinite%20Method%20Object/README.md
不可变辅助工具https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2691.Immutability%20Helper/README.md
使对象不可变https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2692.Make%20Object%20Immutable/README.md
使用自定义上下文调用函数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2693.Call%20Function%20with%20Custom%20Context/README.md
事件发射器https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2694.Event%20Emitter/README.md
包装数组https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2695.Array%20Wrapper/README.md
删除子串后的字符串最小长度https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README.md
字典序最小回文串https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README.md
求一个整数的惩罚数https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README.md
修改图中的边权https://github.com/gitbruce/leetcode2/blob/main/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README.md
两个对象之间的差异https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README.md
连续递增交易https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README.md
使数字变为非正数的最小操作次数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README.md
返回传递的参数的长度https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2703.Return%20Length%20of%20Arguments%20Passed/README.md
相等还是不相等https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2704.To%20Be%20Or%20Not%20To%20Be/README.md
精简对象https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2705.Compact%20Object/README.md
购买两块巧克力https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2706.Buy%20Two%20Chocolates/README.md
字符串中的额外字符https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README.md
一个小组的最大实力值https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README.md
最大公约数遍历https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README.md
移除字符串中的尾随零https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README.md
对角线上不同值的数量差https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README.md
使所有字符相等的最小成本https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README.md
矩阵中严格递增的单元格数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README.md
找到最短路径的 K 次跨越https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README.md
执行可取消的延迟函数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2715.Timeout%20Cancellation/README.md
最小化字符串长度https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2716.Minimize%20String%20Length/README.md
半有序排列https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2717.Semi-Ordered%20Permutation/README.md
查询后矩阵的和https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README.md
统计整数数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2719.Count%20of%20Integers/README.md
受欢迎度百分比https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2720.Popularity%20Percentage/README.md
并行执行异步函数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README.md
根据 ID 合并两个数组https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2722.Join%20Two%20Arrays%20by%20ID/README.md
两个 Promise 对象相加https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2723.Add%20Two%20Promises/README.md
排序方式https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2724.Sort%20By/README.md
间隔取消https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2725.Interval%20Cancellation/README.md
使用方法链的计算器https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2726.Calculator%20with%20Method%20Chaining/README.md
判断对象是否为空https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2727.Is%20Object%20Empty/README.md
计算一个环形街道上的房屋数量https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README.md
判断一个数是否迷人https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README.md
找到最长的半重复子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README.md
移动机器人https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2731.Movement%20of%20Robots/README.md
找到矩阵中的好子集https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README.md
既不是最小值也不是最大值https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README.md
执行子串操作后的字典序最小字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README.md
收集巧克力https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2735.Collecting%20Chocolates/README.md
最大和查询https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md
找到最近的标记节点https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README.md
统计文本中单词的出现次数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README.md
总行驶距离https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2739.Total%20Distance%20Traveled/README.md
找出分区值https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README.md
特别的排列https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2741.Special%20Permutations/README.md
给墙壁刷油漆https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2742.Painting%20the%20Walls/README.md
计算没有重复字符的子字符串数量https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README.md
最大字符串配对数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README.md
构造最长的新字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README.md
字符串连接删减字母https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2746.Decremental%20String%20Concatenation/README.md
统计没有收到请求的服务器数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README.md
美丽下标对的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README.md
得到整数零需要执行的最少操作数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README.md
将数组划分成若干好子数组的方式https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README.md
机器人碰撞https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2751.Robot%20Collisions/README.md
在连续天数上进行了最多交易次数的顾客https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README.md
计算一个环形街道上的房屋数量 IIhttps://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md
将函数绑定到上下文https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2754.Bind%20Function%20to%20Context/README.md
深度合并两个对象https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README.md
批处理查询https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2756.Query%20Batching/README.md
生成循环数组的值https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README.md
下一天https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2758.Next%20Day/README.md
将 JSON 字符串转换为对象https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README.md
最长奇偶子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README.md
和等于目标值的质数对https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README.md
不间断子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2762.Continuous%20Subarrays/README.md
所有子数组中不平衡数字之和https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README.md
数组是否表示某二叉树的前序遍历https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README.md
最长交替子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README.md
重新放置石块https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2766.Relocate%20Marbles/README.md
将字符串分割为最少的美丽子字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README.md
黑格子的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README.md
找出最大的可达成数字https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README.md
达到末尾下标所需的最大跳跃次数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README.md
构造最长非递减子数组https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README.md
使数组中的所有元素都等于零https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README.md
特殊二叉树的高度https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README.md
数组的上界https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2774.Array%20Upper%20Bound/README.md
将 undefined 转为 nullhttps://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2775.Undefined%20to%20Null/README.md
转换回调函数为 Promise 函数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README.md
日期范围生成器https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2777.Date%20Range%20Generator/README.md
特殊元素平方和https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README.md
数组的最大美丽值https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README.md
合法分割的最小下标https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README.md
最长合法子字符串的长度https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README.md
唯一类别的数量https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README.md
航班入座率和等待名单分析https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README.md
检查数组是否是好的https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README.md
将字符串中的元音字母排序https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README.md
访问数组中的位置使分数最大https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README.md
将一个数字表示成幂的和的方案数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README.md
按分隔符拆分字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README.md
合并后数组中的最大元素https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README.md
长度递增组的最大数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README.md
树中可以形成回文的路径数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README.md
计算足够大的节点数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README.md
航班机票状态https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README.md
从两个数组中创建对象https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README.md
并行执行 Promise 以获取独有的结果https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README.md
重复字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2796.Repeat%20String/README.md
带有占位符的部分函数https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md
满足目标工作时长的员工数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README.md
统计完全子数组的数目https://github.com/gitbruce/leetcode2/blob/main/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md
包含三个字符串的最短字符串https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md
统计范围内的步进数字数目https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md
找出第 K 个幸运数字https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md
阶乘生成器https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2803.Factorial%20Generator/README.md
数组原型的 forEach 方法https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md
自定义间隔https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2805.Custom%20Interval/README.md
取整购买后的账户余额https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README.md
在链表中插入最大公约数https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README.md
使循环数组所有元素相等的最少秒数https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README.md
使数组和小于等于 x 的最少时间https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README.md
故障键盘https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2810.Faulty%20Keyboard/README.md
判断是否能拆分数组https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README.md
找出最安全路径https://github.com/gitbruce/leetcode2/blob/main/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README.md
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.