René's URL Explorer Experiment


Title: leetcode-1/solution at main · CPythoner/leetcode-1 · GitHub

Open Graph Title: leetcode-1/solution at main · CPythoner/leetcode-1

X Title: leetcode-1/solution at main · CPythoner/leetcode-1

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

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

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

Mail addresses
contact@yanglibin.info

Opengraph URL: https://github.com/CPythoner/leetcode-1/tree/main/solution

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository/tree/*name(/*path)
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:11c2e73f-7579-1eaf-6b9f-d28c8de3490c
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idB964:CB8D3:10A37:1708B:6A59CCC9
html-safe-nonce3d17bd9f3500356ad98c018b4592e69c8e0ca97d0f7eb8f7cce387984eb7021c
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCOTY0OkNCOEQzOjEwQTM3OjE3MDhCOjZBNTlDQ0M5IiwidmlzaXRvcl9pZCI6IjUzNzIwNTE1NTU1MjgzMzA0NDEiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ==
visitor-hmac7cd5bc4a161cc4712ea410fda614ba45310397c8b5d0ff0ce66370dd060e96cf
hovercard-subject-tagrepository:412005604
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/CPythoner/leetcode-1/tree/main/solution
twitter:imagehttps://opengraph.githubassets.com/eea0195c1cb8d588c194074354af1331a658dff81dd490129301f8a0ff247bd5/CPythoner/leetcode-1
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/eea0195c1cb8d588c194074354af1331a658dff81dd490129301f8a0ff247bd5/CPythoner/leetcode-1
og:image:alt😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - CPythoner/leetcode-1
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Noneba3976babb66479b1c943a8edc0777d96157da48fadc0161f9ddb219deee8353
turbo-cache-controlno-cache
go-importgithub.com/CPythoner/leetcode-1 git https://github.com/CPythoner/leetcode-1.git
octolytics-dimension-user_id6645605
octolytics-dimension-user_loginCPythoner
octolytics-dimension-repository_id412005604
octolytics-dimension-repository_nwoCPythoner/leetcode-1
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
releaseab680789ae4a316cdaf0d5a292a1760140931cc4
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/CPythoner/leetcode-1/tree/main/solution#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FCPythoner%2Fleetcode-1%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%2FCPythoner%2Fleetcode-1%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=CPythoner%2Fleetcode-1
Reloadhttps://github.com/CPythoner/leetcode-1/tree/main/solution
Reloadhttps://github.com/CPythoner/leetcode-1/tree/main/solution
Reloadhttps://github.com/CPythoner/leetcode-1/tree/main/solution
CPythoner https://github.com/CPythoner
leetcode-1https://github.com/CPythoner/leetcode-1
doocs/leetcodehttps://github.com/doocs/leetcode
Notifications https://github.com/login?return_to=%2FCPythoner%2Fleetcode-1
Fork 0 https://github.com/login?return_to=%2FCPythoner%2Fleetcode-1
Star 0 https://github.com/login?return_to=%2FCPythoner%2Fleetcode-1
Code https://github.com/CPythoner/leetcode-1
Pull requests 0 https://github.com/CPythoner/leetcode-1/pulls
Actions https://github.com/CPythoner/leetcode-1/actions
Projects https://github.com/CPythoner/leetcode-1/projects
Security and quality 0 https://github.com/CPythoner/leetcode-1/security
Insights https://github.com/CPythoner/leetcode-1/pulse
Code https://github.com/CPythoner/leetcode-1
Pull requests https://github.com/CPythoner/leetcode-1/pulls
Actions https://github.com/CPythoner/leetcode-1/actions
Projects https://github.com/CPythoner/leetcode-1/projects
Security and quality https://github.com/CPythoner/leetcode-1/security
Insights https://github.com/CPythoner/leetcode-1/pulse
https://github.com/CPythoner/leetcode-1
leetcode-1https://github.com/CPythoner/leetcode-1/tree/main
Historyhttps://github.com/CPythoner/leetcode-1/commits/main/solution
https://github.com/CPythoner/leetcode-1/commits/main/solution
leetcode-1https://github.com/CPythoner/leetcode-1/tree/main
..https://github.com/CPythoner/leetcode-1/tree/main
0000-0099https://github.com/CPythoner/leetcode-1/tree/main/solution/0000-0099
0000-0099https://github.com/CPythoner/leetcode-1/tree/main/solution/0000-0099
0100-0199https://github.com/CPythoner/leetcode-1/tree/main/solution/0100-0199
0100-0199https://github.com/CPythoner/leetcode-1/tree/main/solution/0100-0199
0200-0299https://github.com/CPythoner/leetcode-1/tree/main/solution/0200-0299
0200-0299https://github.com/CPythoner/leetcode-1/tree/main/solution/0200-0299
0300-0399https://github.com/CPythoner/leetcode-1/tree/main/solution/0300-0399
0300-0399https://github.com/CPythoner/leetcode-1/tree/main/solution/0300-0399
0400-0499https://github.com/CPythoner/leetcode-1/tree/main/solution/0400-0499
0400-0499https://github.com/CPythoner/leetcode-1/tree/main/solution/0400-0499
0500-0599https://github.com/CPythoner/leetcode-1/tree/main/solution/0500-0599
0500-0599https://github.com/CPythoner/leetcode-1/tree/main/solution/0500-0599
0600-0699https://github.com/CPythoner/leetcode-1/tree/main/solution/0600-0699
0600-0699https://github.com/CPythoner/leetcode-1/tree/main/solution/0600-0699
0700-0799https://github.com/CPythoner/leetcode-1/tree/main/solution/0700-0799
0700-0799https://github.com/CPythoner/leetcode-1/tree/main/solution/0700-0799
0800-0899https://github.com/CPythoner/leetcode-1/tree/main/solution/0800-0899
0800-0899https://github.com/CPythoner/leetcode-1/tree/main/solution/0800-0899
0900-0999https://github.com/CPythoner/leetcode-1/tree/main/solution/0900-0999
0900-0999https://github.com/CPythoner/leetcode-1/tree/main/solution/0900-0999
1000-1099https://github.com/CPythoner/leetcode-1/tree/main/solution/1000-1099
1000-1099https://github.com/CPythoner/leetcode-1/tree/main/solution/1000-1099
1100-1199https://github.com/CPythoner/leetcode-1/tree/main/solution/1100-1199
1100-1199https://github.com/CPythoner/leetcode-1/tree/main/solution/1100-1199
1200-1299https://github.com/CPythoner/leetcode-1/tree/main/solution/1200-1299
1200-1299https://github.com/CPythoner/leetcode-1/tree/main/solution/1200-1299
1300-1399https://github.com/CPythoner/leetcode-1/tree/main/solution/1300-1399
1300-1399https://github.com/CPythoner/leetcode-1/tree/main/solution/1300-1399
1400-1499https://github.com/CPythoner/leetcode-1/tree/main/solution/1400-1499
1400-1499https://github.com/CPythoner/leetcode-1/tree/main/solution/1400-1499
1500-1599https://github.com/CPythoner/leetcode-1/tree/main/solution/1500-1599
1500-1599https://github.com/CPythoner/leetcode-1/tree/main/solution/1500-1599
1600-1699https://github.com/CPythoner/leetcode-1/tree/main/solution/1600-1699
1600-1699https://github.com/CPythoner/leetcode-1/tree/main/solution/1600-1699
1700-1799https://github.com/CPythoner/leetcode-1/tree/main/solution/1700-1799
1700-1799https://github.com/CPythoner/leetcode-1/tree/main/solution/1700-1799
1800-1899https://github.com/CPythoner/leetcode-1/tree/main/solution/1800-1899
1800-1899https://github.com/CPythoner/leetcode-1/tree/main/solution/1800-1899
1900-1999https://github.com/CPythoner/leetcode-1/tree/main/solution/1900-1999
1900-1999https://github.com/CPythoner/leetcode-1/tree/main/solution/1900-1999
2000-2099https://github.com/CPythoner/leetcode-1/tree/main/solution/2000-2099
2000-2099https://github.com/CPythoner/leetcode-1/tree/main/solution/2000-2099
README.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/README.md
README.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/README.md
README_EN.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/README_EN.md
README_EN.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/README_EN.md
__init__.pyhttps://github.com/CPythoner/leetcode-1/blob/main/solution/__init__.py
__init__.pyhttps://github.com/CPythoner/leetcode-1/blob/main/solution/__init__.py
bash_problem_readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/bash_problem_readme_template.md
bash_problem_readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/bash_problem_readme_template.md
bash_problem_readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/bash_problem_readme_template_en.md
bash_problem_readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/bash_problem_readme_template_en.md
main.pyhttps://github.com/CPythoner/leetcode-1/blob/main/solution/main.py
main.pyhttps://github.com/CPythoner/leetcode-1/blob/main/solution/main.py
problem_readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/problem_readme_template.md
problem_readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/problem_readme_template.md
problem_readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/problem_readme_template_en.md
problem_readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/problem_readme_template_en.md
readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/readme_template.md
readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/readme_template.md
readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/readme_template_en.md
readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/readme_template_en.md
sql_problem_readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/sql_problem_readme_template.md
sql_problem_readme_template.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/sql_problem_readme_template.md
sql_problem_readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/sql_problem_readme_template_en.md
sql_problem_readme_template_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/sql_problem_readme_template_en.md
summary.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/summary.md
summary.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/summary.md
summary_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/summary_en.md
summary_en.mdhttps://github.com/CPythoner/leetcode-1/blob/main/solution/summary_en.md
README.mdhttps://github.com/CPythoner/leetcode-1/tree/main/solution#readme
https://github.com/CPythoner/leetcode-1/tree/main/solution#leetcode
English Versionhttps://github.com/CPythoner/leetcode-1/blob/main/solution/README_EN.md
https://github.com/CPythoner/leetcode-1/tree/main/solution#题解
LeetCode 中国官网https://leetcode-cn.com/problemset/all
doocs/leetcode 贡献者https://github.com/doocs/leetcode/graphs/contributors
0001https://leetcode-cn.com/problems/two-sum
两数之和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0001.Two%20Sum/README.md
0002https://leetcode-cn.com/problems/add-two-numbers
两数相加https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0002.Add%20Two%20Numbers/README.md
0003https://leetcode-cn.com/problems/longest-substring-without-repeating-characters
无重复字符的最长子串https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md
0004https://leetcode-cn.com/problems/median-of-two-sorted-arrays
寻找两个正序数组的中位数https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md
0005https://leetcode-cn.com/problems/longest-palindromic-substring
最长回文子串https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md
0006https://leetcode-cn.com/problems/zigzag-conversion
Z 字形变换https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0006.ZigZag%20Conversion/README.md
0007https://leetcode-cn.com/problems/reverse-integer
整数反转https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0007.Reverse%20Integer/README.md
0008https://leetcode-cn.com/problems/string-to-integer-atoi
字符串转换整数 (atoi)https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md
0009https://leetcode-cn.com/problems/palindrome-number
回文数https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0009.Palindrome%20Number/README.md
0010https://leetcode-cn.com/problems/regular-expression-matching
正则表达式匹配https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md
0011https://leetcode-cn.com/problems/container-with-most-water
盛最多水的容器https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md
0012https://leetcode-cn.com/problems/integer-to-roman
整数转罗马数字https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0012.Integer%20to%20Roman/README.md
0013https://leetcode-cn.com/problems/roman-to-integer
罗马数字转整数https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0013.Roman%20to%20Integer/README.md
0014https://leetcode-cn.com/problems/longest-common-prefix
最长公共前缀https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md
0015https://leetcode-cn.com/problems/3sum
三数之和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0015.3Sum/README.md
0016https://leetcode-cn.com/problems/3sum-closest
最接近的三数之和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0016.3Sum%20Closest/README.md
0017https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number
电话号码的字母组合https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md
0018https://leetcode-cn.com/problems/4sum
四数之和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0018.4Sum/README.md
0019https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list
删除链表的倒数第 N 个结点https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md
0028https://leetcode-cn.com/problems/implement-strstr
实现 strStr()https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0028.Implement%20strStr%28%29/README.md
0039https://leetcode-cn.com/problems/combination-sum
组合总和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0039.Combination%20Sum/README.md
0040https://leetcode-cn.com/problems/combination-sum-ii
组合总和 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0040.Combination%20Sum%20II/README.md
0041https://leetcode-cn.com/problems/first-missing-positive
缺失的第一个正数https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0041.First%20Missing%20Positive/README.md
0042https://leetcode-cn.com/problems/trapping-rain-water
接雨水https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md
0043https://leetcode-cn.com/problems/multiply-strings
字符串相乘https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0043.Multiply%20Strings/README.md
0044https://leetcode-cn.com/problems/wildcard-matching
通配符匹配https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0044.Wildcard%20Matching/README.md
0045https://leetcode-cn.com/problems/jump-game-ii
跳跃游戏 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README.md
0046https://leetcode-cn.com/problems/permutations
全排列https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0046.Permutations/README.md
0047https://leetcode-cn.com/problems/permutations-ii
全排列 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0047.Permutations%20II/README.md
0048https://leetcode-cn.com/problems/rotate-image
旋转图像https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0048.Rotate%20Image/README.md
0049https://leetcode-cn.com/problems/group-anagrams
字母异位词分组https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0049.Group%20Anagrams/README.md
0050https://leetcode-cn.com/problems/powx-n
Pow(x, n)https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md
0051https://leetcode-cn.com/problems/n-queens
N 皇后https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0051.N-Queens/README.md
0052https://leetcode-cn.com/problems/n-queens-ii
N皇后 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0052.N-Queens%20II/README.md
0053https://leetcode-cn.com/problems/maximum-subarray
最大子序和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0053.Maximum%20Subarray/README.md
0054https://leetcode-cn.com/problems/spiral-matrix
螺旋矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0054.Spiral%20Matrix/README.md
0055https://leetcode-cn.com/problems/jump-game
跳跃游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0055.Jump%20Game/README.md
0056https://leetcode-cn.com/problems/merge-intervals
合并区间https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0056.Merge%20Intervals/README.md
0057https://leetcode-cn.com/problems/insert-interval
插入区间https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0057.Insert%20Interval/README.md
0058https://leetcode-cn.com/problems/length-of-last-word
最后一个单词的长度https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md
0059https://leetcode-cn.com/problems/spiral-matrix-ii
螺旋矩阵 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md
0060https://leetcode-cn.com/problems/permutation-sequence
排列序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0060.Permutation%20Sequence/README.md
0061https://leetcode-cn.com/problems/rotate-list
旋转链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0061.Rotate%20List/README.md
0062https://leetcode-cn.com/problems/unique-paths
不同路径https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0062.Unique%20Paths/README.md
0063https://leetcode-cn.com/problems/unique-paths-ii
不同路径 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0063.Unique%20Paths%20II/README.md
0064https://leetcode-cn.com/problems/minimum-path-sum
最小路径和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md
0065https://leetcode-cn.com/problems/valid-number
有效数字https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0065.Valid%20Number/README.md
0066https://leetcode-cn.com/problems/plus-one
加一https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0066.Plus%20One/README.md
0067https://leetcode-cn.com/problems/add-binary
二进制求和https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0067.Add%20Binary/README.md
0068https://leetcode-cn.com/problems/text-justification
文本左右对齐https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0068.Text%20Justification/README.md
0069https://leetcode-cn.com/problems/sqrtx
Sqrt(x)https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0069.Sqrt%28x%29/README.md
0070https://leetcode-cn.com/problems/climbing-stairs
爬楼梯https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0070.Climbing%20Stairs/README.md
0084https://leetcode-cn.com/problems/largest-rectangle-in-histogram
柱状图中最大的矩形https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md
0085https://leetcode-cn.com/problems/maximal-rectangle
最大矩形https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0085.Maximal%20Rectangle/README.md
0086https://leetcode-cn.com/problems/partition-list
分隔链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0086.Partition%20List/README.md
0087https://leetcode-cn.com/problems/scramble-string
扰乱字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0087.Scramble%20String/README.md
0088https://leetcode-cn.com/problems/merge-sorted-array
合并两个有序数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md
0089https://leetcode-cn.com/problems/gray-code
格雷编码https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0089.Gray%20Code/README.md
0090https://leetcode-cn.com/problems/subsets-ii
子集 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0090.Subsets%20II/README.md
0091https://leetcode-cn.com/problems/decode-ways
解码方法https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0091.Decode%20Ways/README.md
0092https://leetcode-cn.com/problems/reverse-linked-list-ii
反转链表 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md
0093https://leetcode-cn.com/problems/restore-ip-addresses
复原 IP 地址https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md
0094https://leetcode-cn.com/problems/binary-tree-inorder-traversal
二叉树的中序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md
0095https://leetcode-cn.com/problems/unique-binary-search-trees-ii
不同的二叉搜索树 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md
0096https://leetcode-cn.com/problems/unique-binary-search-trees
不同的二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md
0097https://leetcode-cn.com/problems/interleaving-string
交错字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0097.Interleaving%20String/README.md
0098https://leetcode-cn.com/problems/validate-binary-search-tree
验证二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md
0099https://leetcode-cn.com/problems/recover-binary-search-tree
恢复二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md
0100https://leetcode-cn.com/problems/same-tree
相同的树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0100.Same%20Tree/README.md
0101https://leetcode-cn.com/problems/symmetric-tree
对称二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0101.Symmetric%20Tree/README.md
0102https://leetcode-cn.com/problems/binary-tree-level-order-traversal
二叉树的层序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md
0103https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal
二叉树的锯齿形层序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md
0104https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
二叉树的最大深度https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md
0105https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
从前序与中序遍历序列构造二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md
0106https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
从中序与后序遍历序列构造二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md
0107https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii
二叉树的层序遍历 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md
0108https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree
将有序数组转换为二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md
0109https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree
有序链表转换二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md
0110https://leetcode-cn.com/problems/balanced-binary-tree
平衡二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md
0111https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
二叉树的最小深度https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md
0112https://leetcode-cn.com/problems/path-sum
路径总和https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0112.Path%20Sum/README.md
0113https://leetcode-cn.com/problems/path-sum-ii
路径总和 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0113.Path%20Sum%20II/README.md
0114https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list
二叉树展开为链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md
0115https://leetcode-cn.com/problems/distinct-subsequences
不同的子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0115.Distinct%20Subsequences/README.md
0116https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node
填充每个节点的下一个右侧节点指针https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md
0117https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii
填充每个节点的下一个右侧节点指针 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md
0118https://leetcode-cn.com/problems/pascals-triangle
杨辉三角https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md
0119https://leetcode-cn.com/problems/pascals-triangle-ii
杨辉三角 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md
0133https://leetcode-cn.com/problems/clone-graph
克隆图https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0133.Clone%20Graph/README.md
0134https://leetcode-cn.com/problems/gas-station
加油站https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0134.Gas%20Station/README.md
0135https://leetcode-cn.com/problems/candy
分发糖果https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0135.Candy/README.md
0136https://leetcode-cn.com/problems/single-number
只出现一次的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0136.Single%20Number/README.md
0137https://leetcode-cn.com/problems/single-number-ii
只出现一次的数字 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0137.Single%20Number%20II/README.md
0138https://leetcode-cn.com/problems/copy-list-with-random-pointer
复制带随机指针的链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md
0139https://leetcode-cn.com/problems/word-break
单词拆分https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0139.Word%20Break/README.md
0140https://leetcode-cn.com/problems/word-break-ii
单词拆分 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0140.Word%20Break%20II/README.md
0141https://leetcode-cn.com/problems/linked-list-cycle
环形链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0141.Linked%20List%20Cycle/README.md
0142https://leetcode-cn.com/problems/linked-list-cycle-ii
环形链表 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md
0143https://leetcode-cn.com/problems/reorder-list
重排链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0143.Reorder%20List/README.md
0144https://leetcode-cn.com/problems/binary-tree-preorder-traversal
二叉树的前序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md
0145https://leetcode-cn.com/problems/binary-tree-postorder-traversal
二叉树的后序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md
0146https://leetcode-cn.com/problems/lru-cache
LRU 缓存机制https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0146.LRU%20Cache/README.md
0147https://leetcode-cn.com/problems/insertion-sort-list
对链表进行插入排序https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0147.Insertion%20Sort%20List/README.md
0148https://leetcode-cn.com/problems/sort-list
排序链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0148.Sort%20List/README.md
0149https://leetcode-cn.com/problems/max-points-on-a-line
直线上最多的点数https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md
0150https://leetcode-cn.com/problems/evaluate-reverse-polish-notation
逆波兰表达式求值https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md
0151https://leetcode-cn.com/problems/reverse-words-in-a-string
翻转字符串里的单词https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md
0152https://leetcode-cn.com/problems/maximum-product-subarray
乘积最大子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md
0153https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array
寻找旋转排序数组中的最小值https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md
0154https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii
寻找旋转排序数组中的最小值 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md
0155https://leetcode-cn.com/problems/min-stack
最小栈https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0155.Min%20Stack/README.md
0156https://leetcode-cn.com/problems/binary-tree-upside-down
上下翻转二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md
0157https://leetcode-cn.com/problems/read-n-characters-given-read4
用 Read4 读取 N 个字符https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md
0158https://leetcode-cn.com/problems/read-n-characters-given-read4-ii-call-multiple-times
用 Read4 读取 N 个字符 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README.md
0159https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters
至多包含两个不同字符的最长子串https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md
0160https://leetcode-cn.com/problems/intersection-of-two-linked-lists
相交链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md
0161https://leetcode-cn.com/problems/one-edit-distance
相隔为 1 的编辑距离https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0161.One%20Edit%20Distance/README.md
0162https://leetcode-cn.com/problems/find-peak-element
寻找峰值https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0162.Find%20Peak%20Element/README.md
0163https://leetcode-cn.com/problems/missing-ranges
缺失的区间https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0163.Missing%20Ranges/README.md
0164https://leetcode-cn.com/problems/maximum-gap
最大间距https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0164.Maximum%20Gap/README.md
0165https://leetcode-cn.com/problems/compare-version-numbers
比较版本号https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md
0166https://leetcode-cn.com/problems/fraction-to-recurring-decimal
分数到小数https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md
0167https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted
两数之和 II - 输入有序数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20array%20is%20sorted/README.md
0168https://leetcode-cn.com/problems/excel-sheet-column-title
Excel表列名称https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md
0169https://leetcode-cn.com/problems/majority-element
多数元素https://github.com/CPythoner/leetcode-1/blob/main/solution/0100-0199/0169.Majority%20Element/README.md
0204https://leetcode-cn.com/problems/count-primes
计数质数https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0204.Count%20Primes/README.md
0214https://leetcode-cn.com/problems/shortest-palindrome
最短回文串https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0214.Shortest%20Palindrome/README.md
0222https://leetcode-cn.com/problems/count-complete-tree-nodes
完全二叉树的节点个数https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md
0232https://leetcode-cn.com/problems/implement-queue-using-stacks
用栈实现队列https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md
0240https://leetcode-cn.com/problems/search-a-2d-matrix-ii
搜索二维矩阵 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md
0247https://leetcode-cn.com/problems/strobogrammatic-number-ii
中心对称数 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md
0280https://leetcode-cn.com/problems/wiggle-sort
摆动排序https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0280.Wiggle%20Sort/README.md
0281https://leetcode-cn.com/problems/zigzag-iterator
锯齿迭代器https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0281.Zigzag%20Iterator/README.md
0282https://leetcode-cn.com/problems/expression-add-operators
给表达式添加运算符https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0282.Expression%20Add%20Operators/README.md
0283https://leetcode-cn.com/problems/move-zeroes
移动零https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0283.Move%20Zeroes/README.md
0284https://leetcode-cn.com/problems/peeking-iterator
顶端迭代器https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0284.Peeking%20Iterator/README.md
0285https://leetcode-cn.com/problems/inorder-successor-in-bst
二叉搜索树中的中序后继https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md
0286https://leetcode-cn.com/problems/walls-and-gates
墙与门https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0286.Walls%20and%20Gates/README.md
0287https://leetcode-cn.com/problems/find-the-duplicate-number
寻找重复数https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md
0288https://leetcode-cn.com/problems/unique-word-abbreviation
单词的唯一缩写https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md
0289https://leetcode-cn.com/problems/game-of-life
生命游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0289.Game%20of%20Life/README.md
0290https://leetcode-cn.com/problems/word-pattern
单词规律https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0290.Word%20Pattern/README.md
0291https://leetcode-cn.com/problems/word-pattern-ii
单词规律 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0291.Word%20Pattern%20II/README.md
0292https://leetcode-cn.com/problems/nim-game
Nim 游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0292.Nim%20Game/README.md
0293https://leetcode-cn.com/problems/flip-game
翻转游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0293.Flip%20Game/README.md
0294https://leetcode-cn.com/problems/flip-game-ii
翻转游戏 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0294.Flip%20Game%20II/README.md
0295https://leetcode-cn.com/problems/find-median-from-data-stream
数据流的中位数https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md
0296https://leetcode-cn.com/problems/best-meeting-point
最佳的碰头地点https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0296.Best%20Meeting%20Point/README.md
0297https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree
二叉树的序列化与反序列化https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md
0298https://leetcode-cn.com/problems/binary-tree-longest-consecutive-sequence
二叉树最长连续序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md
0299https://leetcode-cn.com/problems/bulls-and-cows
猜数字游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0200-0299/0299.Bulls%20and%20Cows/README.md
0300https://leetcode-cn.com/problems/longest-increasing-subsequence
最长递增子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md
0301https://leetcode-cn.com/problems/remove-invalid-parentheses
删除无效的括号https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md
0302https://leetcode-cn.com/problems/smallest-rectangle-enclosing-black-pixels
包含全部黑色像素的最小矩形https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md
0303https://leetcode-cn.com/problems/range-sum-query-immutable
区域和检索 - 数组不可变https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md
0304https://leetcode-cn.com/problems/range-sum-query-2d-immutable
二维区域和检索 - 矩阵不可变https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md
0305https://leetcode-cn.com/problems/number-of-islands-ii
岛屿数量 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md
0306https://leetcode-cn.com/problems/additive-number
累加数https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0306.Additive%20Number/README.md
0307https://leetcode-cn.com/problems/range-sum-query-mutable
区域和检索 - 数组可修改https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md
0308https://leetcode-cn.com/problems/range-sum-query-2d-mutable
二维区域和检索 - 可变https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md
0309https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown
最佳买卖股票时机含冷冻期https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md
0310https://leetcode-cn.com/problems/minimum-height-trees
最小高度树https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md
0311https://leetcode-cn.com/problems/sparse-matrix-multiplication
稀疏矩阵的乘法https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md
0312https://leetcode-cn.com/problems/burst-balloons
戳气球https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0312.Burst%20Balloons/README.md
0313https://leetcode-cn.com/problems/super-ugly-number
超级丑数https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0313.Super%20Ugly%20Number/README.md
0314https://leetcode-cn.com/problems/binary-tree-vertical-order-traversal
二叉树的垂直遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md
0315https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self
计算右侧小于当前元素的个数https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md
0316https://leetcode-cn.com/problems/remove-duplicate-letters
去除重复字母https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md
0317https://leetcode-cn.com/problems/shortest-distance-from-all-buildings
离建筑物最近的距离https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md
0318https://leetcode-cn.com/problems/maximum-product-of-word-lengths
最大单词长度乘积https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md
0319https://leetcode-cn.com/problems/bulb-switcher
灯泡开关https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0319.Bulb%20Switcher/README.md
0320https://leetcode-cn.com/problems/generalized-abbreviation
列举单词的全部缩写https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0320.Generalized%20Abbreviation/README.md
0330https://leetcode-cn.com/problems/patching-array
按要求补齐数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0300-0399/0330.Patching%20Array/README.md
0414https://leetcode-cn.com/problems/third-maximum-number
第三大的数https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0414.Third%20Maximum%20Number/README.md
0427https://leetcode-cn.com/problems/construct-quad-tree
建立四叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md
0428https://leetcode-cn.com/problems/serialize-and-deserialize-n-ary-tree
序列化和反序列化 N 叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md
0429https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal
N 叉树的层序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md
0430https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list
扁平化多级双向链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md
0431https://leetcode-cn.com/problems/encode-n-ary-tree-to-binary-tree
将 N 叉树编码为二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md
0441https://leetcode-cn.com/problems/arranging-coins
排列硬币https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0441.Arranging%20Coins/README.md
0464https://leetcode-cn.com/problems/can-i-win
我能赢吗https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0464.Can%20I%20Win/README.md
0467https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string
环绕字符串中唯一的子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md
0468https://leetcode-cn.com/problems/validate-ip-address
验证IP地址https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0468.Validate%20IP%20Address/README.md
0469https://leetcode-cn.com/problems/convex-polygon
凸多边形https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0469.Convex%20Polygon/README.md
0470https://leetcode-cn.com/problems/implement-rand10-using-rand7
用 Rand7() 实现 Rand10()https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md
0471https://leetcode-cn.com/problems/encode-string-with-shortest-length
编码最短长度的字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md
0472https://leetcode-cn.com/problems/concatenated-words
连接词https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0472.Concatenated%20Words/README.md
0473https://leetcode-cn.com/problems/matchsticks-to-square
火柴拼正方形https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md
0474https://leetcode-cn.com/problems/ones-and-zeroes
一和零https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md
0475https://leetcode-cn.com/problems/heaters
供暖器https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0475.Heaters/README.md
0476https://leetcode-cn.com/problems/number-complement
数字的补数https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0476.Number%20Complement/README.md
0492https://leetcode-cn.com/problems/construct-the-rectangle
构造矩形https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md
0493https://leetcode-cn.com/problems/reverse-pairs
翻转对https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0493.Reverse%20Pairs/README.md
0494https://leetcode-cn.com/problems/target-sum
目标和https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0494.Target%20Sum/README.md
0495https://leetcode-cn.com/problems/teemo-attacking
提莫攻击https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0495.Teemo%20Attacking/README.md
0496https://leetcode-cn.com/problems/next-greater-element-i
下一个更大元素 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md
0498https://leetcode-cn.com/problems/diagonal-traverse
对角线遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0498.Diagonal%20Traverse/README.md
0499https://leetcode-cn.com/problems/the-maze-iii
迷宫 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0400-0499/0499.The%20Maze%20III/README.md
0500https://leetcode-cn.com/problems/keyboard-row
键盘行https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0500.Keyboard%20Row/README.md
0501https://leetcode-cn.com/problems/find-mode-in-binary-search-tree
二叉搜索树中的众数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md
0502https://leetcode-cn.com/problems/ipo
IPOhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0502.IPO/README.md
0503https://leetcode-cn.com/problems/next-greater-element-ii
下一个更大元素 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md
0504https://leetcode-cn.com/problems/base-7
七进制数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0504.Base%207/README.md
0505https://leetcode-cn.com/problems/the-maze-ii
迷宫 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0505.The%20Maze%20II/README.md
0506https://leetcode-cn.com/problems/relative-ranks
相对名次https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0506.Relative%20Ranks/README.md
0507https://leetcode-cn.com/problems/perfect-number
完美数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0507.Perfect%20Number/README.md
0508https://leetcode-cn.com/problems/most-frequent-subtree-sum
出现次数最多的子树元素和https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md
0509https://leetcode-cn.com/problems/fibonacci-number
斐波那契数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0509.Fibonacci%20Number/README.md
0510https://leetcode-cn.com/problems/inorder-successor-in-bst-ii
二叉搜索树中的中序后继 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md
0511https://leetcode-cn.com/problems/game-play-analysis-i
游戏玩法分析 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md
0513https://leetcode-cn.com/problems/find-bottom-left-tree-value
找树左下角的值https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md
0514https://leetcode-cn.com/problems/freedom-trail
自由之路https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0514.Freedom%20Trail/README.md
0515https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row
在每个树行中找最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md
0516https://leetcode-cn.com/problems/longest-palindromic-subsequence
最长回文子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md
0517https://leetcode-cn.com/problems/super-washing-machines
超级洗衣机https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0517.Super%20Washing%20Machines/README.md
0518https://leetcode-cn.com/problems/coin-change-2
零钱兑换 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0518.Coin%20Change%202/README.md
0520https://leetcode-cn.com/problems/detect-capital
检测大写字母https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0520.Detect%20Capital/README.md
0521https://leetcode-cn.com/problems/longest-uncommon-subsequence-i
最长特殊序列 Ⅰhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md
0522https://leetcode-cn.com/problems/longest-uncommon-subsequence-ii
最长特殊序列 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md
0523https://leetcode-cn.com/problems/continuous-subarray-sum
连续的子数组和https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md
0524https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting
通过删除字母匹配到字典里最长单词https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md
0525https://leetcode-cn.com/problems/contiguous-array
连续数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0525.Contiguous%20Array/README.md
0526https://leetcode-cn.com/problems/beautiful-arrangement
优美的排列https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0526.Beautiful%20Arrangement/README.md
0527https://leetcode-cn.com/problems/word-abbreviation
单词缩写https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0527.Word%20Abbreviation/README.md
0529https://leetcode-cn.com/problems/minesweeper
扫雷游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0529.Minesweeper/README.md
0530https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst
二叉搜索树的最小绝对差https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md
0558https://leetcode-cn.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees
四叉树交集https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md
0559https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree
N 叉树的最大深度https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md
0563https://leetcode-cn.com/problems/binary-tree-tilt
二叉树的坡度https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md
0564https://leetcode-cn.com/problems/find-the-closest-palindrome
寻找最近的回文数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md
0565https://leetcode-cn.com/problems/array-nesting
数组嵌套https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0565.Array%20Nesting/README.md
0566https://leetcode-cn.com/problems/reshape-the-matrix
重塑矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md
0567https://leetcode-cn.com/problems/permutation-in-string
字符串的排列https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0567.Permutation%20in%20String/README.md
0568https://leetcode-cn.com/problems/maximum-vacation-days
最大休假天数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md
0569https://leetcode-cn.com/problems/median-employee-salary
员工薪水中位数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0569.Median%20Employee%20Salary/README.md
0570https://leetcode-cn.com/problems/managers-with-at-least-5-direct-reports
至少有5名直接下属的经理https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md
0571https://leetcode-cn.com/problems/find-median-given-frequency-of-numbers
给定数字的频率查询中位数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md
0572https://leetcode-cn.com/problems/subtree-of-another-tree
另一棵树的子树https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md
0573https://leetcode-cn.com/problems/squirrel-simulation
松鼠模拟https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0573.Squirrel%20Simulation/README.md
0574https://leetcode-cn.com/problems/winning-candidate
当选者https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0574.Winning%20Candidate/README.md
0575https://leetcode-cn.com/problems/distribute-candies
分糖果https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0575.Distribute%20Candies/README.md
0576https://leetcode-cn.com/problems/out-of-boundary-paths
出界的路径数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md
0577https://leetcode-cn.com/problems/employee-bonus
员工奖金https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0577.Employee%20Bonus/README.md
0578https://leetcode-cn.com/problems/get-highest-answer-rate-question
查询回答率最高的问题https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md
0579https://leetcode-cn.com/problems/find-cumulative-salary-of-an-employee
查询员工的累计薪水https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md
0580https://leetcode-cn.com/problems/count-student-number-in-departments
统计各专业学生人数https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md
0581https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray
最短无序连续子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md
0582https://leetcode-cn.com/problems/kill-process
杀掉进程https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0582.Kill%20Process/README.md
0583https://leetcode-cn.com/problems/delete-operation-for-two-strings
两个字符串的删除操作https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md
0588https://leetcode-cn.com/problems/design-in-memory-file-system
设计内存文件系统https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md
0589https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal
N 叉树的前序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md
0590https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal
N 叉树的后序遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md
0599https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists
两个列表的最小索引总和https://github.com/CPythoner/leetcode-1/blob/main/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md
0600https://leetcode-cn.com/problems/non-negative-integers-without-consecutive-ones
不含连续1的非负整数https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md
0601https://leetcode-cn.com/problems/human-traffic-of-stadium
体育馆的人流量https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md
0602https://leetcode-cn.com/problems/friend-requests-ii-who-has-the-most-friends
好友申请 II ：谁有最多的好友https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md
0603https://leetcode-cn.com/problems/consecutive-available-seats
连续空余座位https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md
0604https://leetcode-cn.com/problems/design-compressed-string-iterator
迭代压缩字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md
0605https://leetcode-cn.com/problems/can-place-flowers
种花问题https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0605.Can%20Place%20Flowers/README.md
0606https://leetcode-cn.com/problems/construct-string-from-binary-tree
根据二叉树创建字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md
0607https://leetcode-cn.com/problems/sales-person
销售员https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0607.Sales%20Person/README.md
0608https://leetcode-cn.com/problems/tree-node
树节点https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0608.Tree%20Node/README.md
0609https://leetcode-cn.com/problems/find-duplicate-file-in-system
在系统中查找重复文件https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md
0610https://leetcode-cn.com/problems/triangle-judgement
判断三角形https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0610.Triangle%20Judgement/README.md
0611https://leetcode-cn.com/problems/valid-triangle-number
有效三角形的个数https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md
0612https://leetcode-cn.com/problems/shortest-distance-in-a-plane
平面上的最近距离https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md
0613https://leetcode-cn.com/problems/shortest-distance-in-a-line
直线上的最近距离https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md
0614https://leetcode-cn.com/problems/second-degree-follower
二级关注者https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0614.Second%20Degree%20Follower/README.md
0615https://leetcode-cn.com/problems/average-salary-departments-vs-company
平均工资：部门与公司比较https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md
0616https://leetcode-cn.com/problems/add-bold-tag-in-string
给字符串添加加粗标签https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md
0617https://leetcode-cn.com/problems/merge-two-binary-trees
合并二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md
0618https://leetcode-cn.com/problems/students-report-by-geography
学生地理信息报告https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md
0619https://leetcode-cn.com/problems/biggest-single-number
只出现一次的最大数字https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0619.Biggest%20Single%20Number/README.md
0620https://leetcode-cn.com/problems/not-boring-movies
有趣的电影https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0620.Not%20Boring%20Movies/README.md
0621https://leetcode-cn.com/problems/task-scheduler
任务调度器https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0621.Task%20Scheduler/README.md
0623https://leetcode-cn.com/problems/add-one-row-to-tree
在二叉树中增加一行https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md
0624https://leetcode-cn.com/problems/maximum-distance-in-arrays
数组列表中的最大距离https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md
0625https://leetcode-cn.com/problems/minimum-factorization
最小因式分解https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0625.Minimum%20Factorization/README.md
0626https://leetcode-cn.com/problems/exchange-seats
换座位https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0626.Exchange%20Seats/README.md
0627https://leetcode-cn.com/problems/swap-salary
变更性别https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0627.Swap%20Salary/README.md
0628https://leetcode-cn.com/problems/maximum-product-of-three-numbers
三个数的最大乘积https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md
0629https://leetcode-cn.com/problems/k-inverse-pairs-array
K个逆序对数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md
0630https://leetcode-cn.com/problems/course-schedule-iii
课程表 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0630.Course%20Schedule%20III/README.md
0631https://leetcode-cn.com/problems/design-excel-sum-formula
设计 Excel 求和公式https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md
0632https://leetcode-cn.com/problems/smallest-range-covering-elements-from-k-lists
最小区间https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md
0633https://leetcode-cn.com/problems/sum-of-square-numbers
平方数之和https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md
0634https://leetcode-cn.com/problems/find-the-derangement-of-an-array
寻找数组的错位排列https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md
0635https://leetcode-cn.com/problems/design-log-storage-system
设计日志存储系统https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md
0636https://leetcode-cn.com/problems/exclusive-time-of-functions
函数的独占时间https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md
0637https://leetcode-cn.com/problems/average-of-levels-in-binary-tree
二叉树的层平均值https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md
0638https://leetcode-cn.com/problems/shopping-offers
大礼包https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0638.Shopping%20Offers/README.md
0639https://leetcode-cn.com/problems/decode-ways-ii
解码方法 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0639.Decode%20Ways%20II/README.md
0640https://leetcode-cn.com/problems/solve-the-equation
求解方程https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0640.Solve%20the%20Equation/README.md
0642https://leetcode-cn.com/problems/design-search-autocomplete-system
设计搜索自动补全系统https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md
0643https://leetcode-cn.com/problems/maximum-average-subarray-i
子数组最大平均数 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md
0644https://leetcode-cn.com/problems/maximum-average-subarray-ii
子数组最大平均数 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md
0645https://leetcode-cn.com/problems/set-mismatch
错误的集合https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0645.Set%20Mismatch/README.md
0646https://leetcode-cn.com/problems/maximum-length-of-pair-chain
最长数对链https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md
0647https://leetcode-cn.com/problems/palindromic-substrings
回文子串https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0647.Palindromic%20Substrings/README.md
0648https://leetcode-cn.com/problems/replace-words
单词替换https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0648.Replace%20Words/README.md
0649https://leetcode-cn.com/problems/dota2-senate
Dota2 参议院https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0649.Dota2%20Senate/README.md
0650https://leetcode-cn.com/problems/2-keys-keyboard
只有两个键的键盘https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md
0651https://leetcode-cn.com/problems/4-keys-keyboard
4键键盘https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md
0652https://leetcode-cn.com/problems/find-duplicate-subtrees
寻找重复的子树https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md
0653https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst
两数之和 IV - 输入 BSThttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md
0654https://leetcode-cn.com/problems/maximum-binary-tree
最大二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md
0655https://leetcode-cn.com/problems/print-binary-tree
输出二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0655.Print%20Binary%20Tree/README.md
0656https://leetcode-cn.com/problems/coin-path
金币路径https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0656.Coin%20Path/README.md
0657https://leetcode-cn.com/problems/robot-return-to-origin
机器人能否返回原点https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md
0658https://leetcode-cn.com/problems/find-k-closest-elements
找到 K 个最接近的元素https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md
0659https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences
分割数组为连续子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md
0660https://leetcode-cn.com/problems/remove-9
移除 9https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0660.Remove%209/README.md
0661https://leetcode-cn.com/problems/image-smoother
图片平滑器https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0661.Image%20Smoother/README.md
0662https://leetcode-cn.com/problems/maximum-width-of-binary-tree
二叉树最大宽度https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md
0663https://leetcode-cn.com/problems/equal-tree-partition
均匀树划分https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md
0664https://leetcode-cn.com/problems/strange-printer
奇怪的打印机https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0664.Strange%20Printer/README.md
0665https://leetcode-cn.com/problems/non-decreasing-array
非递减数列https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0665.Non-decreasing%20Array/README.md
0666https://leetcode-cn.com/problems/path-sum-iv
路径总和 IVhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0666.Path%20Sum%20IV/README.md
0667https://leetcode-cn.com/problems/beautiful-arrangement-ii
优美的排列 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md
0668https://leetcode-cn.com/problems/kth-smallest-number-in-multiplication-table
乘法表中第k小的数https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md
0669https://leetcode-cn.com/problems/trim-a-binary-search-tree
修剪二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md
0670https://leetcode-cn.com/problems/maximum-swap
最大交换https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0670.Maximum%20Swap/README.md
0671https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree
二叉树中第二小的节点https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md
0672https://leetcode-cn.com/problems/bulb-switcher-ii
灯泡开关 Ⅱhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md
0673https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence
最长递增子序列的个数https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md
0674https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence
最长连续递增序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md
0675https://leetcode-cn.com/problems/cut-off-trees-for-golf-event
为高尔夫比赛砍树https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md
0676https://leetcode-cn.com/problems/implement-magic-dictionary
实现一个魔法字典https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md
0677https://leetcode-cn.com/problems/map-sum-pairs
键值映射https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md
0678https://leetcode-cn.com/problems/valid-parenthesis-string
有效的括号字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md
0679https://leetcode-cn.com/problems/24-game
24 点游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0679.24%20Game/README.md
0680https://leetcode-cn.com/problems/valid-palindrome-ii
验证回文字符串 Ⅱhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md
0681https://leetcode-cn.com/problems/next-closest-time
最近时刻https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0681.Next%20Closest%20Time/README.md
0682https://leetcode-cn.com/problems/baseball-game
棒球比赛https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0682.Baseball%20Game/README.md
0683https://leetcode-cn.com/problems/k-empty-slots
K 个关闭的灯泡https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0683.K%20Empty%20Slots/README.md
0684https://leetcode-cn.com/problems/redundant-connection
冗余连接https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0684.Redundant%20Connection/README.md
0685https://leetcode-cn.com/problems/redundant-connection-ii
冗余连接 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0685.Redundant%20Connection%20II/README.md
0686https://leetcode-cn.com/problems/repeated-string-match
重复叠加字符串匹配https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0686.Repeated%20String%20Match/README.md
0687https://leetcode-cn.com/problems/longest-univalue-path
最长同值路径https://github.com/CPythoner/leetcode-1/blob/main/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md
0700https://leetcode-cn.com/problems/search-in-a-binary-search-tree
二叉搜索树中的搜索https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md
0701https://leetcode-cn.com/problems/insert-into-a-binary-search-tree
二叉搜索树中的插入操作https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md
0702https://leetcode-cn.com/problems/search-in-a-sorted-array-of-unknown-size
搜索长度未知的有序数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md
0703https://leetcode-cn.com/problems/kth-largest-element-in-a-stream
数据流中的第 K 大元素https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md
0704https://leetcode-cn.com/problems/binary-search
二分查找https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0704.Binary%20Search/README.md
0709https://leetcode-cn.com/problems/to-lower-case
转换成小写字母https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0709.To%20Lower%20Case/README.md
0710https://leetcode-cn.com/problems/random-pick-with-blacklist
黑名单中的随机数https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md
0713https://leetcode-cn.com/problems/subarray-product-less-than-k
乘积小于K的子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md
0714https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee
买卖股票的最佳时机含手续费https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md
0715https://leetcode-cn.com/problems/range-module
Range 模块https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0715.Range%20Module/README.md
0716https://leetcode-cn.com/problems/max-stack
最大栈https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0716.Max%20Stack/README.md
0717https://leetcode-cn.com/problems/1-bit-and-2-bit-characters
1比特与2比特字符https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md
0718https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray
最长重复子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md
0719https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance
找出第 k 小的距离对https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md
0720https://leetcode-cn.com/problems/longest-word-in-dictionary
词典中最长的单词https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md
0721https://leetcode-cn.com/problems/accounts-merge
账户合并https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0721.Accounts%20Merge/README.md
0722https://leetcode-cn.com/problems/remove-comments
删除注释https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0722.Remove%20Comments/README.md
0723https://leetcode-cn.com/problems/candy-crush
粉碎糖果https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0723.Candy%20Crush/README.md
0724https://leetcode-cn.com/problems/find-pivot-index
寻找数组的中心下标https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0724.Find%20Pivot%20Index/README.md
0725https://leetcode-cn.com/problems/split-linked-list-in-parts
分隔链表https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md
0726https://leetcode-cn.com/problems/number-of-atoms
原子的数量https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0726.Number%20of%20Atoms/README.md
0727https://leetcode-cn.com/problems/minimum-window-subsequence
最小窗口子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md
0728https://leetcode-cn.com/problems/self-dividing-numbers
自除数https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md
0729https://leetcode-cn.com/problems/my-calendar-i
我的日程安排表 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0729.My%20Calendar%20I/README.md
0730https://leetcode-cn.com/problems/count-different-palindromic-subsequences
统计不同回文子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md
0731https://leetcode-cn.com/problems/my-calendar-ii
我的日程安排表 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0731.My%20Calendar%20II/README.md
0732https://leetcode-cn.com/problems/my-calendar-iii
我的日程安排表 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0732.My%20Calendar%20III/README.md
0733https://leetcode-cn.com/problems/flood-fill
图像渲染https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0733.Flood%20Fill/README.md
0734https://leetcode-cn.com/problems/sentence-similarity
句子相似性https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0734.Sentence%20Similarity/README.md
0735https://leetcode-cn.com/problems/asteroid-collision
行星碰撞https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0735.Asteroid%20Collision/README.md
0736https://leetcode-cn.com/problems/parse-lisp-expression
Lisp 语法解析https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md
0737https://leetcode-cn.com/problems/sentence-similarity-ii
句子相似性 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md
0738https://leetcode-cn.com/problems/monotone-increasing-digits
单调递增的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md
0739https://leetcode-cn.com/problems/daily-temperatures
每日温度https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0739.Daily%20Temperatures/README.md
0740https://leetcode-cn.com/problems/delete-and-earn
删除并获得点数https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0740.Delete%20and%20Earn/README.md
0741https://leetcode-cn.com/problems/cherry-pickup
摘樱桃https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0741.Cherry%20Pickup/README.md
0742https://leetcode-cn.com/problems/closest-leaf-in-a-binary-tree
二叉树最近的叶节点https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md
0743https://leetcode-cn.com/problems/network-delay-time
网络延迟时间https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0743.Network%20Delay%20Time/README.md
0744https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target
寻找比目标字母大的最小字母https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md
0745https://leetcode-cn.com/problems/prefix-and-suffix-search
前缀和后缀搜索https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md
0746https://leetcode-cn.com/problems/min-cost-climbing-stairs
使用最小花费爬楼梯https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md
0747https://leetcode-cn.com/problems/largest-number-at-least-twice-of-others
至少是其他数字两倍的最大数https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md
0761https://leetcode-cn.com/problems/special-binary-string
特殊的二进制序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0761.Special%20Binary%20String/README.md
0762https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation
二进制表示中质数个计算置位https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md
0763https://leetcode-cn.com/problems/partition-labels
划分字母区间https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0763.Partition%20Labels/README.md
0764https://leetcode-cn.com/problems/largest-plus-sign
最大加号标志https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md
0765https://leetcode-cn.com/problems/couples-holding-hands
情侣牵手https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md
0766https://leetcode-cn.com/problems/toeplitz-matrix
托普利茨矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0766.Toeplitz%20Matrix/README.md
0767https://leetcode-cn.com/problems/reorganize-string
重构字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0767.Reorganize%20String/README.md
0768https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii
最多能完成排序的块 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md
0769https://leetcode-cn.com/problems/max-chunks-to-make-sorted
最多能完成排序的块https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md
0770https://leetcode-cn.com/problems/basic-calculator-iv
基本计算器 IVhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md
0771https://leetcode-cn.com/problems/jewels-and-stones
宝石与石头https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0771.Jewels%20and%20Stones/README.md
0772https://leetcode-cn.com/problems/basic-calculator-iii
基本计算器 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0772.Basic%20Calculator%20III/README.md
0773https://leetcode-cn.com/problems/sliding-puzzle
滑动谜题https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0773.Sliding%20Puzzle/README.md
0774https://leetcode-cn.com/problems/minimize-max-distance-to-gas-station
最小化去加油站的最大距离https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md
0775https://leetcode-cn.com/problems/global-and-local-inversions
全局倒置与局部倒置https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md
0776https://leetcode-cn.com/problems/split-bst
拆分二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0776.Split%20BST/README.md
0777https://leetcode-cn.com/problems/swap-adjacent-in-lr-string
在LR字符串中交换相邻字符https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md
0778https://leetcode-cn.com/problems/swim-in-rising-water
水位上升的泳池中游泳https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md
0779https://leetcode-cn.com/problems/k-th-symbol-in-grammar
第K个语法符号https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md
0780https://leetcode-cn.com/problems/reaching-points
到达终点https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0780.Reaching%20Points/README.md
0781https://leetcode-cn.com/problems/rabbits-in-forest
森林中的兔子https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md
0782https://leetcode-cn.com/problems/transform-to-chessboard
变为棋盘https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md
0789https://leetcode-cn.com/problems/escape-the-ghosts
逃脱阻碍者https://github.com/CPythoner/leetcode-1/blob/main/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md
0842https://leetcode-cn.com/problems/split-array-into-fibonacci-sequence
将数组拆分成斐波那契序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md
0852https://leetcode-cn.com/problems/peak-index-in-a-mountain-array
山脉数组的峰顶索引https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md
0860https://leetcode-cn.com/problems/lemonade-change
柠檬水找零https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0860.Lemonade%20Change/README.md
0861https://leetcode-cn.com/problems/score-after-flipping-matrix
翻转矩阵后的得分https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md
0862https://leetcode-cn.com/problems/shortest-subarray-with-sum-at-least-k
和至少为 K 的最短子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md
0863https://leetcode-cn.com/problems/all-nodes-distance-k-in-binary-tree
二叉树中所有距离为 K 的结点https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md
0864https://leetcode-cn.com/problems/shortest-path-to-get-all-keys
获取所有钥匙的最短路径https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md
0865https://leetcode-cn.com/problems/smallest-subtree-with-all-the-deepest-nodes
具有所有最深节点的最小子树https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md
0866https://leetcode-cn.com/problems/prime-palindrome
回文素数https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0866.Prime%20Palindrome/README.md
0867https://leetcode-cn.com/problems/transpose-matrix
转置矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0867.Transpose%20Matrix/README.md
0868https://leetcode-cn.com/problems/binary-gap
二进制间距https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0868.Binary%20Gap/README.md
0869https://leetcode-cn.com/problems/reordered-power-of-2
重新排序得到 2 的幂https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md
0870https://leetcode-cn.com/problems/advantage-shuffle
优势洗牌https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0870.Advantage%20Shuffle/README.md
0871https://leetcode-cn.com/problems/minimum-number-of-refueling-stops
最低加油次数https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md
0872https://leetcode-cn.com/problems/leaf-similar-trees
叶子相似的树https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md
0873https://leetcode-cn.com/problems/length-of-longest-fibonacci-subsequence
最长的斐波那契子序列的长度https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md
0874https://leetcode-cn.com/problems/walking-robot-simulation
模拟行走机器人https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md
0882https://leetcode-cn.com/problems/reachable-nodes-in-subdivided-graph
细分图中的可到达结点https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md
0894https://leetcode-cn.com/problems/all-possible-full-binary-trees
所有可能的满二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md
0906https://leetcode-cn.com/problems/super-palindromes
超级回文数https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0906.Super%20Palindromes/README.md
0910https://leetcode-cn.com/problems/smallest-range-ii
最小差值 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0910.Smallest%20Range%20II/README.md
0911https://leetcode-cn.com/problems/online-election
在线选举https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0911.Online%20Election/README.md
0912https://leetcode-cn.com/problems/sort-an-array
排序数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0912.Sort%20an%20Array/README.md
0913https://leetcode-cn.com/problems/cat-and-mouse
猫和老鼠https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0913.Cat%20and%20Mouse/README.md
0914https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards
卡牌分组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md
0915https://leetcode-cn.com/problems/partition-array-into-disjoint-intervals
分割数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md
0916https://leetcode-cn.com/problems/word-subsets
单词子集https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0916.Word%20Subsets/README.md
0917https://leetcode-cn.com/problems/reverse-only-letters
仅仅反转字母https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md
0918https://leetcode-cn.com/problems/maximum-sum-circular-subarray
环形子数组的最大和https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md
0919https://leetcode-cn.com/problems/complete-binary-tree-inserter
完全二叉树插入器https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md
0923https://leetcode-cn.com/problems/3sum-with-multiplicity
三数之和的多种可能https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md
0924https://leetcode-cn.com/problems/minimize-malware-spread
尽量减少恶意软件的传播https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md
0925https://leetcode-cn.com/problems/long-pressed-name
长按键入https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0925.Long%20Pressed%20Name/README.md
0926https://leetcode-cn.com/problems/flip-string-to-monotone-increasing
将字符串翻转到单调递增https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md
0927https://leetcode-cn.com/problems/three-equal-parts
三等分https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0927.Three%20Equal%20Parts/README.md
0928https://leetcode-cn.com/problems/minimize-malware-spread-ii
尽量减少恶意软件的传播 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md
0929https://leetcode-cn.com/problems/unique-email-addresses
独特的电子邮件地址https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md
0930https://leetcode-cn.com/problems/binary-subarrays-with-sum
和相同的二元子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md
0931https://leetcode-cn.com/problems/minimum-falling-path-sum
下降路径最小和https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md
0932https://leetcode-cn.com/problems/beautiful-array
漂亮数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0932.Beautiful%20Array/README.md
0933https://leetcode-cn.com/problems/number-of-recent-calls
最近的请求次数https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md
0934https://leetcode-cn.com/problems/shortest-bridge
最短的桥https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0934.Shortest%20Bridge/README.md
0935https://leetcode-cn.com/problems/knight-dialer
骑士拨号器https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0935.Knight%20Dialer/README.md
0936https://leetcode-cn.com/problems/stamping-the-sequence
戳印序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md
0937https://leetcode-cn.com/problems/reorder-data-in-log-files
重新排列日志文件https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md
0938https://leetcode-cn.com/problems/range-sum-of-bst
二叉搜索树的范围和https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md
0939https://leetcode-cn.com/problems/minimum-area-rectangle
最小面积矩形https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md
0940https://leetcode-cn.com/problems/distinct-subsequences-ii
不同的子序列 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md
0941https://leetcode-cn.com/problems/valid-mountain-array
有效的山脉数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md
0942https://leetcode-cn.com/problems/di-string-match
增减字符串匹配https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0942.DI%20String%20Match/README.md
0943https://leetcode-cn.com/problems/find-the-shortest-superstring
最短超级串https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md
0944https://leetcode-cn.com/problems/delete-columns-to-make-sorted
删列造序https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md
0945https://leetcode-cn.com/problems/minimum-increment-to-make-array-unique
使数组唯一的最小增量https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md
0946https://leetcode-cn.com/problems/validate-stack-sequences
验证栈序列https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md
0947https://leetcode-cn.com/problems/most-stones-removed-with-same-row-or-column
移除最多的同行或同列石头https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md
0948https://leetcode-cn.com/problems/bag-of-tokens
令牌放置https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0948.Bag%20of%20Tokens/README.md
0949https://leetcode-cn.com/problems/largest-time-for-given-digits
给定数字能组成的最大时间https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md
0950https://leetcode-cn.com/problems/reveal-cards-in-increasing-order
按递增顺序显示卡牌https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md
0951https://leetcode-cn.com/problems/flip-equivalent-binary-trees
翻转等价二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md
0952https://leetcode-cn.com/problems/largest-component-size-by-common-factor
按公因数计算最大组件大小https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md
0953https://leetcode-cn.com/problems/verifying-an-alien-dictionary
验证外星语词典https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md
0954https://leetcode-cn.com/problems/array-of-doubled-pairs
二倍数对数组https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md
0955https://leetcode-cn.com/problems/delete-columns-to-make-sorted-ii
删列造序 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md
0956https://leetcode-cn.com/problems/tallest-billboard
最高的广告牌https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0956.Tallest%20Billboard/README.md
0957https://leetcode-cn.com/problems/prison-cells-after-n-days
N 天后的牢房https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md
0958https://leetcode-cn.com/problems/check-completeness-of-a-binary-tree
二叉树的完全性检验https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md
0959https://leetcode-cn.com/problems/regions-cut-by-slashes
由斜杠划分区域https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md
0960https://leetcode-cn.com/problems/delete-columns-to-make-sorted-iii
删列造序 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md
0961https://leetcode-cn.com/problems/n-repeated-element-in-size-2n-array
重复 N 次的元素https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md
0962https://leetcode-cn.com/problems/maximum-width-ramp
最大宽度坡https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md
0963https://leetcode-cn.com/problems/minimum-area-rectangle-ii
最小面积矩形 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md
0964https://leetcode-cn.com/problems/least-operators-to-express-number
表示数字的最少运算符https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md
0965https://leetcode-cn.com/problems/univalued-binary-tree
单值二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md
0966https://leetcode-cn.com/problems/vowel-spellchecker
元音拼写检查器https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0966.Vowel%20Spellchecker/README.md
0967https://leetcode-cn.com/problems/numbers-with-same-consecutive-differences
连续差相同的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md
0968https://leetcode-cn.com/problems/binary-tree-cameras
监控二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md
0969https://leetcode-cn.com/problems/pancake-sorting
煎饼排序https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0969.Pancake%20Sorting/README.md
0983https://leetcode-cn.com/problems/minimum-cost-for-tickets
最低票价https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md
0994https://leetcode-cn.com/problems/rotting-oranges
腐烂的橘子https://github.com/CPythoner/leetcode-1/blob/main/solution/0900-0999/0994.Rotting%20Oranges/README.md
1001https://leetcode-cn.com/problems/grid-illumination
网格照明https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1001.Grid%20Illumination/README.md
1002https://leetcode-cn.com/problems/find-common-characters
查找共用字符https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1002.Find%20Common%20Characters/README.md
1003https://leetcode-cn.com/problems/check-if-word-is-valid-after-substitutions
检查替换后的词是否有效https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md
1004https://leetcode-cn.com/problems/max-consecutive-ones-iii
最大连续1的个数 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md
1005https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations
K 次取反后最大化的数组和https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md
1006https://leetcode-cn.com/problems/clumsy-factorial
笨阶乘https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1006.Clumsy%20Factorial/README.md
1007https://leetcode-cn.com/problems/minimum-domino-rotations-for-equal-row
行相等的最少多米诺旋转https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md
1008https://leetcode-cn.com/problems/construct-binary-search-tree-from-preorder-traversal
前序遍历构造二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md
1009https://leetcode-cn.com/problems/complement-of-base-10-integer
十进制整数的反码https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md
1010https://leetcode-cn.com/problems/pairs-of-songs-with-total-durations-divisible-by-60
总持续时间可被 60 整除的歌曲https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md
1011https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days
在 D 天内送达包裹的能力https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md
1012https://leetcode-cn.com/problems/numbers-with-repeated-digits
至少有 1 位重复的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md
1025https://leetcode-cn.com/problems/divisor-game
除数博弈https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1025.Divisor%20Game/README.md
1026https://leetcode-cn.com/problems/maximum-difference-between-node-and-ancestor
节点与其祖先之间的最大差值https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md
1027https://leetcode-cn.com/problems/longest-arithmetic-subsequence
最长等差数列https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md
1028https://leetcode-cn.com/problems/recover-a-tree-from-preorder-traversal
从先序遍历还原二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md
1029https://leetcode-cn.com/problems/two-city-scheduling
两地调度https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1029.Two%20City%20Scheduling/README.md
1030https://leetcode-cn.com/problems/matrix-cells-in-distance-order
距离顺序排列矩阵单元格https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md
1031https://leetcode-cn.com/problems/maximum-sum-of-two-non-overlapping-subarrays
两个非重叠子数组的最大和https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md
1032https://leetcode-cn.com/problems/stream-of-characters
字符流https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1032.Stream%20of%20Characters/README.md
1033https://leetcode-cn.com/problems/moving-stones-until-consecutive
移动石子直到连续https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md
1034https://leetcode-cn.com/problems/coloring-a-border
边框着色https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1034.Coloring%20A%20Border/README.md
1035https://leetcode-cn.com/problems/uncrossed-lines
不相交的线https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1035.Uncrossed%20Lines/README.md
1036https://leetcode-cn.com/problems/escape-a-large-maze
逃离大迷宫https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md
1039https://leetcode-cn.com/problems/minimum-score-triangulation-of-polygon
多边形三角剖分的最低得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md
1045https://leetcode-cn.com/problems/customers-who-bought-all-products
买下所有产品的客户https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md
1046https://leetcode-cn.com/problems/last-stone-weight
最后一块石头的重量https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1046.Last%20Stone%20Weight/README.md
1047https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string
删除字符串中的所有相邻重复项https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md
1048https://leetcode-cn.com/problems/longest-string-chain
最长字符串链https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1048.Longest%20String%20Chain/README.md
1049https://leetcode-cn.com/problems/last-stone-weight-ii
最后一块石头的重量 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md
1050https://leetcode-cn.com/problems/actors-and-directors-who-cooperated-at-least-three-times
合作过至少三次的演员和导演https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md
1051https://leetcode-cn.com/problems/height-checker
高度检查器https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1051.Height%20Checker/README.md
1052https://leetcode-cn.com/problems/grumpy-bookstore-owner
爱生气的书店老板https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md
1053https://leetcode-cn.com/problems/previous-permutation-with-one-swap
交换一次的先前排列https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md
1054https://leetcode-cn.com/problems/distant-barcodes
距离相等的条形码https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1054.Distant%20Barcodes/README.md
1055https://leetcode-cn.com/problems/shortest-way-to-form-string
形成字符串的最短路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md
1057https://leetcode-cn.com/problems/campus-bikes
校园自行车分配https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1057.Campus%20Bikes/README.md
1058https://leetcode-cn.com/problems/minimize-rounding-error-to-meet-target
最小化舍入误差以满足目标https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md
1059https://leetcode-cn.com/problems/all-paths-from-source-lead-to-destination
从始点到终点的所有路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md
1060https://leetcode-cn.com/problems/missing-element-in-sorted-array
有序数组中的缺失元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md
1061https://leetcode-cn.com/problems/lexicographically-smallest-equivalent-string
按字典序排列最小的等效字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md
1062https://leetcode-cn.com/problems/longest-repeating-substring
最长重复子串https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md
1063https://leetcode-cn.com/problems/number-of-valid-subarrays
有效子数组的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md
1068https://leetcode-cn.com/problems/product-sales-analysis-i
产品销售分析 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md
1069https://leetcode-cn.com/problems/product-sales-analysis-ii
产品销售分析 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md
1070https://leetcode-cn.com/problems/product-sales-analysis-iii
产品销售分析 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md
1071https://leetcode-cn.com/problems/greatest-common-divisor-of-strings
字符串的最大公因子https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md
1072https://leetcode-cn.com/problems/flip-columns-for-maximum-number-of-equal-rows
按列翻转得到最大值等行数https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md
1073https://leetcode-cn.com/problems/adding-two-negabinary-numbers
负二进制数相加https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md
1074https://leetcode-cn.com/problems/number-of-submatrices-that-sum-to-target
元素和为目标值的子矩阵数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md
1075https://leetcode-cn.com/problems/project-employees-i
项目员工 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1075.Project%20Employees%20I/README.md
1076https://leetcode-cn.com/problems/project-employees-ii
项目员工IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1076.Project%20Employees%20II/README.md
1077https://leetcode-cn.com/problems/project-employees-iii
项目员工 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1077.Project%20Employees%20III/README.md
1078https://leetcode-cn.com/problems/occurrences-after-bigram
Bigram 分词https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md
1079https://leetcode-cn.com/problems/letter-tile-possibilities
活字印刷https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md
1080https://leetcode-cn.com/problems/insufficient-nodes-in-root-to-leaf-paths
根到叶路径上的不足节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md
1081https://leetcode-cn.com/problems/smallest-subsequence-of-distinct-characters
不同字符的最小子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md
1085https://leetcode-cn.com/problems/sum-of-digits-in-the-minimum-number
最小元素各数位之和https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md
1090https://leetcode-cn.com/problems/largest-values-from-labels
受标签影响的最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md
1093https://leetcode-cn.com/problems/statistics-from-a-large-sample
大样本统计https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md
1094https://leetcode-cn.com/problems/car-pooling
拼车https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1094.Car%20Pooling/README.md
1095https://leetcode-cn.com/problems/find-in-mountain-array
山脉数组中查找目标值https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md
1096https://leetcode-cn.com/problems/brace-expansion-ii
花括号展开 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1096.Brace%20Expansion%20II/README.md
1097https://leetcode-cn.com/problems/game-play-analysis-v
游戏玩法分析 Vhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md
1098https://leetcode-cn.com/problems/unpopular-books
小众书籍https://github.com/CPythoner/leetcode-1/blob/main/solution/1000-1099/1098.Unpopular%20Books/README.md
1100https://leetcode-cn.com/problems/find-k-length-substrings-with-no-repeated-characters
长度为 K 的无重复字符子串https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md
1101https://leetcode-cn.com/problems/the-earliest-moment-when-everyone-become-friends
彼此熟识的最早时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md
1102https://leetcode-cn.com/problems/path-with-maximum-minimum-value
得分最高的路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md
1103https://leetcode-cn.com/problems/distribute-candies-to-people
分糖果 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md
1104https://leetcode-cn.com/problems/path-in-zigzag-labelled-binary-tree
二叉树寻路https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md
1105https://leetcode-cn.com/problems/filling-bookcase-shelves
填充书架https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md
1106https://leetcode-cn.com/problems/parsing-a-boolean-expression
解析布尔表达式https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md
1107https://leetcode-cn.com/problems/new-users-daily-count
每日新用户统计https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md
1108https://leetcode-cn.com/problems/defanging-an-ip-address
IP 地址无效化https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md
1109https://leetcode-cn.com/problems/corporate-flight-bookings
航班预订统计https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md
1110https://leetcode-cn.com/problems/delete-nodes-and-return-forest
删点成林https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md
1111https://leetcode-cn.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings
有效括号的嵌套深度https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md
1112https://leetcode-cn.com/problems/highest-grade-for-each-student
每位学生的最高成绩https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md
1113https://leetcode-cn.com/problems/reported-posts
报告的记录https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1113.Reported%20Posts/README.md
1114https://leetcode-cn.com/problems/print-in-order
按序打印https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1114.Print%20in%20Order/README.md
1115https://leetcode-cn.com/problems/print-foobar-alternately
交替打印FooBarhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md
1116https://leetcode-cn.com/problems/print-zero-even-odd
打印零与奇偶数https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md
1117https://leetcode-cn.com/problems/building-h2o
H2O 生成https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1117.Building%20H2O/README.md
1118https://leetcode-cn.com/problems/number-of-days-in-a-month
一月有多少天https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md
1119https://leetcode-cn.com/problems/remove-vowels-from-a-string
删去字符串中的元音https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md
1120https://leetcode-cn.com/problems/maximum-average-subtree
子树的最大平均值https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md
1122https://leetcode-cn.com/problems/relative-sort-array
数组的相对排序https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1122.Relative%20Sort%20Array/README.md
1123https://leetcode-cn.com/problems/lowest-common-ancestor-of-deepest-leaves
最深叶节点的最近公共祖先https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md
1124https://leetcode-cn.com/problems/longest-well-performing-interval
表现良好的最长时间段https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md
1125https://leetcode-cn.com/problems/smallest-sufficient-team
最小的必要团队https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md
1126https://leetcode-cn.com/problems/active-businesses
查询活跃业务https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1126.Active%20Businesses/README.md
1127https://leetcode-cn.com/problems/user-purchase-platform
用户购买平台https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1127.User%20Purchase%20Platform/README.md
1128https://leetcode-cn.com/problems/number-of-equivalent-domino-pairs
等价多米诺骨牌对的数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md
1129https://leetcode-cn.com/problems/shortest-path-with-alternating-colors
颜色交替的最短路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md
1130https://leetcode-cn.com/problems/minimum-cost-tree-from-leaf-values
叶值的最小代价生成树https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md
1131https://leetcode-cn.com/problems/maximum-of-absolute-value-expression
绝对值表达式的最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md
1132https://leetcode-cn.com/problems/reported-posts-ii
报告的记录 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1132.Reported%20Posts%20II/README.md
1133https://leetcode-cn.com/problems/largest-unique-number
最大唯一数https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1133.Largest%20Unique%20Number/README.md
1134https://leetcode-cn.com/problems/armstrong-number
阿姆斯特朗数https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1134.Armstrong%20Number/README.md
1135https://leetcode-cn.com/problems/connecting-cities-with-minimum-cost
最低成本联通所有城市https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md
1136https://leetcode-cn.com/problems/parallel-courses
平行课程https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1136.Parallel%20Courses/README.md
1137https://leetcode-cn.com/problems/n-th-tribonacci-number
第 N 个泰波那契数https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md
1138https://leetcode-cn.com/problems/alphabet-board-path
字母板上的路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md
1139https://leetcode-cn.com/problems/largest-1-bordered-square
最大的以 1 为边界的正方形https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md
1140https://leetcode-cn.com/problems/stone-game-ii
石子游戏 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1140.Stone%20Game%20II/README.md
1141https://leetcode-cn.com/problems/user-activity-for-the-past-30-days-i
查询近30天活跃用户数https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md
1148https://leetcode-cn.com/problems/article-views-i
文章浏览 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1148.Article%20Views%20I/README.md
1149https://leetcode-cn.com/problems/article-views-ii
文章浏览 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1149.Article%20Views%20II/README.md
1150https://leetcode-cn.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array
检查一个数是否在数组中占绝大多数https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md
1151https://leetcode-cn.com/problems/minimum-swaps-to-group-all-1s-together
最少交换次数来组合所有的 1https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md
1152https://leetcode-cn.com/problems/analyze-user-website-visit-pattern
用户网站访问行为分析https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md
1154https://leetcode-cn.com/problems/day-of-the-year
一年中的第几天https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1154.Day%20of%20the%20Year/README.md
1155https://leetcode-cn.com/problems/number-of-dice-rolls-with-target-sum
掷骰子的N种方法https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md
1156https://leetcode-cn.com/problems/swap-for-longest-repeated-character-substring
单字符重复子串的最大长度https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md
1157https://leetcode-cn.com/problems/online-majority-element-in-subarray
子数组中占绝大多数的元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md
1160https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters
拼写单词https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md
1163https://leetcode-cn.com/problems/last-substring-in-lexicographical-order
按字典序排在最后的子串https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md
1164https://leetcode-cn.com/problems/product-price-at-a-given-date
指定日期的产品价格https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md
1167https://leetcode-cn.com/problems/minimum-cost-to-connect-sticks
连接棒材的最低费用https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md
1168https://leetcode-cn.com/problems/optimize-water-distribution-in-a-village
水资源分配优化https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md
1173https://leetcode-cn.com/problems/immediate-food-delivery-i
即时食物配送 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md
1174https://leetcode-cn.com/problems/immediate-food-delivery-ii
即时食物配送 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md
1176https://leetcode-cn.com/problems/diet-plan-performance
健身计划评估https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md
1177https://leetcode-cn.com/problems/can-make-palindrome-from-substring
构建回文串检测https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md
1178https://leetcode-cn.com/problems/number-of-valid-words-for-each-puzzle
猜字谜https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md
1179https://leetcode-cn.com/problems/reformat-department-table
重新格式化部门表https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1179.Reformat%20Department%20Table/README.md
1180https://leetcode-cn.com/problems/count-substrings-with-only-one-distinct-letter
统计只含单一字母的子串https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md
1181https://leetcode-cn.com/problems/before-and-after-puzzle
前后拼接https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md
1182https://leetcode-cn.com/problems/shortest-distance-to-target-color
与目标颜色间的最短距离https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md
1183https://leetcode-cn.com/problems/maximum-number-of-ones
矩阵中 1 的最大数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md
1184https://leetcode-cn.com/problems/distance-between-bus-stops
公交站间的距离https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md
1185https://leetcode-cn.com/problems/day-of-the-week
一周中的第几天https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1185.Day%20of%20the%20Week/README.md
1186https://leetcode-cn.com/problems/maximum-subarray-sum-with-one-deletion
删除一次得到子数组最大和https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md
1187https://leetcode-cn.com/problems/make-array-strictly-increasing
使数组严格递增https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md
1188https://leetcode-cn.com/problems/design-bounded-blocking-queue
设计有限阻塞队列https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md
1189https://leetcode-cn.com/problems/maximum-number-of-balloons
“气球” 的最大数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md
1190https://leetcode-cn.com/problems/reverse-substrings-between-each-pair-of-parentheses
反转每对括号间的子串https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md
1191https://leetcode-cn.com/problems/k-concatenation-maximum-sum
K 次串联后最大子数组之和https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md
1192https://leetcode-cn.com/problems/critical-connections-in-a-network
查找集群内的「关键连接」https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md
1193https://leetcode-cn.com/problems/monthly-transactions-i
每月交易 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md
1194https://leetcode-cn.com/problems/tournament-winners
锦标赛优胜者https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1194.Tournament%20Winners/README.md
1195https://leetcode-cn.com/problems/fizz-buzz-multithreaded
交替打印字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md
1196https://leetcode-cn.com/problems/how-many-apples-can-you-put-into-the-basket
最多可以买到的苹果数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md
1197https://leetcode-cn.com/problems/minimum-knight-moves
进击的骑士https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md
1198https://leetcode-cn.com/problems/find-smallest-common-element-in-all-rows
找出所有行中最小公共元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md
1200https://leetcode-cn.com/problems/minimum-absolute-difference
最小绝对差https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md
1201https://leetcode-cn.com/problems/ugly-number-iii
丑数 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1201.Ugly%20Number%20III/README.md
1202https://leetcode-cn.com/problems/smallest-string-with-swaps
交换字符串中的元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md
1203https://leetcode-cn.com/problems/sort-items-by-groups-respecting-dependencies
项目管理https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md
1207https://leetcode-cn.com/problems/unique-number-of-occurrences
独一无二的出现次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md
1208https://leetcode-cn.com/problems/get-equal-substrings-within-budget
尽可能使字符串相等https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md
1209https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string-ii
删除字符串中的所有相邻重复项 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md
1210https://leetcode-cn.com/problems/minimum-moves-to-reach-target-with-rotations
穿过迷宫的最少移动次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md
1213https://leetcode-cn.com/problems/intersection-of-three-sorted-arrays
三个有序数组的交集https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md
1214https://leetcode-cn.com/problems/two-sum-bsts
查找两棵二叉搜索树之和https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md
1215https://leetcode-cn.com/problems/stepping-numbers
步进数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1215.Stepping%20Numbers/README.md
1225https://leetcode-cn.com/problems/report-contiguous-dates
报告系统状态的连续日期https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md
1227https://leetcode-cn.com/problems/airplane-seat-assignment-probability
飞机座位分配概率https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md
1228https://leetcode-cn.com/problems/missing-number-in-arithmetic-progression
等差数列中缺失的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md
1229https://leetcode-cn.com/problems/meeting-scheduler
安排会议日程https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1229.Meeting%20Scheduler/README.md
1231https://leetcode-cn.com/problems/divide-chocolate
分享巧克力https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1231.Divide%20Chocolate/README.md
1237https://leetcode-cn.com/problems/find-positive-integer-solution-for-a-given-equation
找出给定方程的正整数解https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md
1238https://leetcode-cn.com/problems/circular-permutation-in-binary-representation
循环码排列https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md
1239https://leetcode-cn.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters
串联字符串的最大长度https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md
1240https://leetcode-cn.com/problems/tiling-a-rectangle-with-the-fewest-squares
铺瓷砖https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md
1241https://leetcode-cn.com/problems/number-of-comments-per-post
每个帖子的评论数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md
1242https://leetcode-cn.com/problems/web-crawler-multithreaded
多线程网页爬虫https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md
1246https://leetcode-cn.com/problems/palindrome-removal
删除回文子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1246.Palindrome%20Removal/README.md
1247https://leetcode-cn.com/problems/minimum-swaps-to-make-strings-equal
交换字符使得字符串相同https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md
1248https://leetcode-cn.com/problems/count-number-of-nice-subarrays
统计「优美子数组」https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md
1249https://leetcode-cn.com/problems/minimum-remove-to-make-valid-parentheses
移除无效的括号https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md
1250https://leetcode-cn.com/problems/check-if-it-is-a-good-array
检查「好数组」https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md
1251https://leetcode-cn.com/problems/average-selling-price
平均售价https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1251.Average%20Selling%20Price/README.md
1252https://leetcode-cn.com/problems/cells-with-odd-values-in-a-matrix
奇数值单元格的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md
1253https://leetcode-cn.com/problems/reconstruct-a-2-row-binary-matrix
重构 2 行二进制矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md
1254https://leetcode-cn.com/problems/number-of-closed-islands
统计封闭岛屿的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md
1255https://leetcode-cn.com/problems/maximum-score-words-formed-by-letters
得分最高的单词集合https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md
1256https://leetcode-cn.com/problems/encode-number
加密数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1256.Encode%20Number/README.md
1257https://leetcode-cn.com/problems/smallest-common-region
最小公共区域https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1257.Smallest%20Common%20Region/README.md
1258https://leetcode-cn.com/problems/synonymous-sentences
近义词句子https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1258.Synonymous%20Sentences/README.md
1259https://leetcode-cn.com/problems/handshakes-that-dont-cross
不相交的握手https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md
1260https://leetcode-cn.com/problems/shift-2d-grid
二维网格迁移https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1260.Shift%202D%20Grid/README.md
1261https://leetcode-cn.com/problems/find-elements-in-a-contaminated-binary-tree
在受污染的二叉树中查找元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md
1262https://leetcode-cn.com/problems/greatest-sum-divisible-by-three
可被三整除的最大和https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md
1263https://leetcode-cn.com/problems/minimum-moves-to-move-a-box-to-their-target-location
推箱子https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md
1271https://leetcode-cn.com/problems/hexspeak
十六进制魔术数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1271.Hexspeak/README.md
1272https://leetcode-cn.com/problems/remove-interval
删除区间https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1272.Remove%20Interval/README.md
1273https://leetcode-cn.com/problems/delete-tree-nodes
删除树节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md
1274https://leetcode-cn.com/problems/number-of-ships-in-a-rectangle
矩形内船只的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md
1279https://leetcode-cn.com/problems/traffic-light-controlled-intersection
红绿灯路口https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md
1280https://leetcode-cn.com/problems/students-and-examinations
学生们参加各科测试的次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1280.Students%20and%20Examinations/README.md
1282https://leetcode-cn.com/problems/group-the-people-given-the-group-size-they-belong-to
用户分组https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md
1283https://leetcode-cn.com/problems/find-the-smallest-divisor-given-a-threshold
使结果不超过阈值的最小除数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md
1284https://leetcode-cn.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix
转化为全零矩阵的最少反转次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md
1285https://leetcode-cn.com/problems/find-the-start-and-end-number-of-continuous-ranges
找到连续区间的开始和结束数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md
1286https://leetcode-cn.com/problems/iterator-for-combination
字母组合迭代器https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1286.Iterator%20for%20Combination/README.md
1287https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array
有序数组中出现次数超过25%的元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md
1288https://leetcode-cn.com/problems/remove-covered-intervals
删除被覆盖区间https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md
1289https://leetcode-cn.com/problems/minimum-falling-path-sum-ii
下降路径最小和 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md
1290https://leetcode-cn.com/problems/convert-binary-number-in-a-linked-list-to-integer
二进制链表转整数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md
1291https://leetcode-cn.com/problems/sequential-digits
顺次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1291.Sequential%20Digits/README.md
1292https://leetcode-cn.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
元素和小于等于阈值的正方形的最大边长https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md
1293https://leetcode-cn.com/problems/shortest-path-in-a-grid-with-obstacles-elimination
网格中的最短路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md
1294https://leetcode-cn.com/problems/weather-type-in-each-country
不同国家的天气类型https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md
1295https://leetcode-cn.com/problems/find-numbers-with-even-number-of-digits
统计位数为偶数的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md
1296https://leetcode-cn.com/problems/divide-array-in-sets-of-k-consecutive-numbers
划分数组为连续数字的集合https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md
1297https://leetcode-cn.com/problems/maximum-number-of-occurrences-of-a-substring
子串的最大出现次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md
1298https://leetcode-cn.com/problems/maximum-candies-you-can-get-from-boxes
你能从盒子里获得的最大糖果数https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md
1299https://leetcode-cn.com/problems/replace-elements-with-greatest-element-on-right-side
将每个元素替换为右侧最大元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md
1300https://leetcode-cn.com/problems/sum-of-mutated-array-closest-to-target
转变数组后最接近目标值的数组和https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md
1301https://leetcode-cn.com/problems/number-of-paths-with-max-score
最大得分的路径数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md
1303https://leetcode-cn.com/problems/find-the-team-size
求团队人数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md
1304https://leetcode-cn.com/problems/find-n-unique-integers-sum-up-to-zero
和为零的N个唯一整数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md
1305https://leetcode-cn.com/problems/all-elements-in-two-binary-search-trees
两棵二叉搜索树中的所有元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md
1306https://leetcode-cn.com/problems/jump-game-iii
跳跃游戏 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1306.Jump%20Game%20III/README.md
1307https://leetcode-cn.com/problems/verbal-arithmetic-puzzle
口算难题https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md
1308https://leetcode-cn.com/problems/running-total-for-different-genders
不同性别每日分数总计https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md
1309https://leetcode-cn.com/problems/decrypt-string-from-alphabet-to-integer-mapping
解码字母到整数映射https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md
1310https://leetcode-cn.com/problems/xor-queries-of-a-subarray
子数组异或查询https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md
1311https://leetcode-cn.com/problems/get-watched-videos-by-your-friends
获取你好友已观看的视频https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md
1312https://leetcode-cn.com/problems/minimum-insertion-steps-to-make-a-string-palindrome
让字符串成为回文串的最少插入次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md
1313https://leetcode-cn.com/problems/decompress-run-length-encoded-list
解压缩编码列表https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md
1314https://leetcode-cn.com/problems/matrix-block-sum
矩阵区域和https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md
1315https://leetcode-cn.com/problems/sum-of-nodes-with-even-valued-grandparent
祖父节点值为偶数的节点和https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md
1317https://leetcode-cn.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers
将整数转换为两个无零整数的和https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md
1318https://leetcode-cn.com/problems/minimum-flips-to-make-a-or-b-equal-to-c
或运算的最小翻转次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md
1319https://leetcode-cn.com/problems/number-of-operations-to-make-network-connected
连通网络的操作次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md
1320https://leetcode-cn.com/problems/minimum-distance-to-type-a-word-using-two-fingers
二指输入的的最小距离https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md
1321https://leetcode-cn.com/problems/restaurant-growth
餐馆营业额变化增长https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1321.Restaurant%20Growth/README.md
1322https://leetcode-cn.com/problems/ads-performance
广告效果https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1322.Ads%20Performance/README.md
1323https://leetcode-cn.com/problems/maximum-69-number
6 和 9 组成的最大数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1323.Maximum%2069%20Number/README.md
1324https://leetcode-cn.com/problems/print-words-vertically
竖直打印单词https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1324.Print%20Words%20Vertically/README.md
1325https://leetcode-cn.com/problems/delete-leaves-with-a-given-value
删除给定值的叶子节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md
1326https://leetcode-cn.com/problems/minimum-number-of-taps-to-open-to-water-a-garden
灌溉花园的最少水龙头数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md
1330https://leetcode-cn.com/problems/reverse-subarray-to-maximize-array-value
翻转子数组得到最大的数组值https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md
1331https://leetcode-cn.com/problems/rank-transform-of-an-array
数组序号转换https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md
1336https://leetcode-cn.com/problems/number-of-transactions-per-visit
每次访问的交易次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md
1339https://leetcode-cn.com/problems/maximum-product-of-splitted-binary-tree
分裂二叉树的最大乘积https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md
1340https://leetcode-cn.com/problems/jump-game-v
跳跃游戏 Vhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1340.Jump%20Game%20V/README.md
1341https://leetcode-cn.com/problems/movie-rating
电影评分https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1341.Movie%20Rating/README.md
1342https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-to-zero
将数字变成 0 的操作次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md
1343https://leetcode-cn.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
大小为 K 且平均值大于等于阈值的子数组数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md
1344https://leetcode-cn.com/problems/angle-between-hands-of-a-clock
时钟指针的夹角https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md
1345https://leetcode-cn.com/problems/jump-game-iv
跳跃游戏 IVhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1345.Jump%20Game%20IV/README.md
1346https://leetcode-cn.com/problems/check-if-n-and-its-double-exist
检查整数及其两倍数是否存在https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md
1347https://leetcode-cn.com/problems/minimum-number-of-steps-to-make-two-strings-anagram
制造字母异位词的最小步骤数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md
1348https://leetcode-cn.com/problems/tweet-counts-per-frequency
推文计数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md
1349https://leetcode-cn.com/problems/maximum-students-taking-exam
参加考试的最大学生数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md
1350https://leetcode-cn.com/problems/students-with-invalid-departments
院系无效的学生https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md
1351https://leetcode-cn.com/problems/count-negative-numbers-in-a-sorted-matrix
统计有序矩阵中的负数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md
1352https://leetcode-cn.com/problems/product-of-the-last-k-numbers
最后 K 个数的乘积https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md
1353https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended
最多可以参加的会议数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md
1354https://leetcode-cn.com/problems/construct-target-array-with-multiple-sums
多次求和构造目标数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md
1355https://leetcode-cn.com/problems/activity-participants
活动参与者https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1355.Activity%20Participants/README.md
1357https://leetcode-cn.com/problems/apply-discount-every-n-orders
每隔 n 个顾客打折https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md
1364https://leetcode-cn.com/problems/number-of-trusted-contacts-of-a-customer
顾客的可信联系人数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md
1365https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number
有多少小于当前数字的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md
1366https://leetcode-cn.com/problems/rank-teams-by-votes
通过投票对团队排名https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md
1367https://leetcode-cn.com/problems/linked-list-in-binary-tree
二叉树中的列表https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md
1368https://leetcode-cn.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid
使网格图至少有一条有效路径的最小代价https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md
1369https://leetcode-cn.com/problems/get-the-second-most-recent-activity
获取最近第二次的活动https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md
1370https://leetcode-cn.com/problems/increasing-decreasing-string
上升下降字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md
1371https://leetcode-cn.com/problems/find-the-longest-substring-containing-vowels-in-even-counts
每个元音包含偶数次的最长子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md
1372https://leetcode-cn.com/problems/longest-zigzag-path-in-a-binary-tree
二叉树中的最长交错路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md
1373https://leetcode-cn.com/problems/maximum-sum-bst-in-binary-tree
二叉搜索子树的最大键值和https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md
1374https://leetcode-cn.com/problems/generate-a-string-with-characters-that-have-odd-counts
生成每种字符都是奇数个的字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md
1375https://leetcode-cn.com/problems/bulb-switcher-iii
灯泡开关 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1375.Bulb%20Switcher%20III/README.md
1376https://leetcode-cn.com/problems/time-needed-to-inform-all-employees
通知所有员工所需的时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md
1377https://leetcode-cn.com/problems/frog-position-after-t-seconds
T 秒后青蛙的位置https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md
1378https://leetcode-cn.com/problems/replace-employee-id-with-the-unique-identifier
使用唯一标识码替换员工IDhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md
1379https://leetcode-cn.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
找出克隆二叉树中的相同节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md
1380https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix
矩阵中的幸运数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md
1381https://leetcode-cn.com/problems/design-a-stack-with-increment-operation
设计一个支持增量操作的栈https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md
1382https://leetcode-cn.com/problems/balance-a-binary-search-tree
将二叉搜索树变平衡https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md
1383https://leetcode-cn.com/problems/maximum-performance-of-a-team
最大的团队表现值https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md
1384https://leetcode-cn.com/problems/total-sales-amount-by-year
按年度列出销售总额https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md
1385https://leetcode-cn.com/problems/find-the-distance-value-between-two-arrays
两个数组间的距离值https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md
1386https://leetcode-cn.com/problems/cinema-seat-allocation
安排电影院座位https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md
1387https://leetcode-cn.com/problems/sort-integers-by-the-power-value
将整数按权重排序https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md
1388https://leetcode-cn.com/problems/pizza-with-3n-slices
3n 块披萨https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md
1389https://leetcode-cn.com/problems/create-target-array-in-the-given-order
按既定顺序创建目标数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md
1390https://leetcode-cn.com/problems/four-divisors
四因数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1390.Four%20Divisors/README.md
1391https://leetcode-cn.com/problems/check-if-there-is-a-valid-path-in-a-grid
检查网格中是否存在有效路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md
1392https://leetcode-cn.com/problems/longest-happy-prefix
最长快乐前缀https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md
1393https://leetcode-cn.com/problems/capital-gainloss
股票的资本损益https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1393.Capital%20GainLoss/README.md
1394https://leetcode-cn.com/problems/find-lucky-integer-in-an-array
找出数组中的幸运数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md
1395https://leetcode-cn.com/problems/count-number-of-teams
统计作战单位数https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md
1396https://leetcode-cn.com/problems/design-underground-system
设计地铁系统https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1396.Design%20Underground%20System/README.md
1397https://leetcode-cn.com/problems/find-all-good-strings
找到所有好字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md
1398https://leetcode-cn.com/problems/customers-who-bought-products-a-and-b-but-not-c
购买了产品 A 和产品 B 却没有购买产品 C 的顾客https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md
1399https://leetcode-cn.com/problems/count-largest-group
统计最大组的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1300-1399/1399.Count%20Largest%20Group/README.md
1400https://leetcode-cn.com/problems/construct-k-palindrome-strings
构造 K 个回文字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md
1401https://leetcode-cn.com/problems/circle-and-rectangle-overlapping
圆和矩形是否有重叠https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md
1402https://leetcode-cn.com/problems/reducing-dishes
做菜顺序https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1402.Reducing%20Dishes/README.md
1403https://leetcode-cn.com/problems/minimum-subsequence-in-non-increasing-order
非递增顺序的最小子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md
1404https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one
将二进制表示减到 1 的步骤数https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md
1405https://leetcode-cn.com/problems/longest-happy-string
最长快乐字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1405.Longest%20Happy%20String/README.md
1406https://leetcode-cn.com/problems/stone-game-iii
石子游戏 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1406.Stone%20Game%20III/README.md
1407https://leetcode-cn.com/problems/top-travellers
排名靠前的旅行者https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1407.Top%20Travellers/README.md
1408https://leetcode-cn.com/problems/string-matching-in-an-array
数组中的字符串匹配https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md
1409https://leetcode-cn.com/problems/queries-on-a-permutation-with-key
查询带键的排列https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md
1410https://leetcode-cn.com/problems/html-entity-parser
HTML 实体解析器https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md
1411https://leetcode-cn.com/problems/number-of-ways-to-paint-n-3-grid
给 N x 3 网格图涂色的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md
1412https://leetcode-cn.com/problems/find-the-quiet-students-in-all-exams
查找成绩处于中游的学生https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md
1413https://leetcode-cn.com/problems/minimum-value-to-get-positive-step-by-step-sum
逐步求和得到正数的最小值https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md
1414https://leetcode-cn.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k
和为 K 的最少斐波那契数字数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md
1415https://leetcode-cn.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
长度为 n 的开心字符串中字典序第 k 小的字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md
1416https://leetcode-cn.com/problems/restore-the-array
恢复数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1416.Restore%20The%20Array/README.md
1417https://leetcode-cn.com/problems/reformat-the-string
重新格式化字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1417.Reformat%20The%20String/README.md
1418https://leetcode-cn.com/problems/display-table-of-food-orders-in-a-restaurant
点菜展示表https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md
1419https://leetcode-cn.com/problems/minimum-number-of-frogs-croaking
数青蛙https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md
1420https://leetcode-cn.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons
生成数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md
1421https://leetcode-cn.com/problems/npv-queries
净现值查询https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1421.NPV%20Queries/README.md
1422https://leetcode-cn.com/problems/maximum-score-after-splitting-a-string
分割字符串的最大得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md
1423https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards
可获得的最大点数https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md
1424https://leetcode-cn.com/problems/diagonal-traverse-ii
对角线遍历 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md
1425https://leetcode-cn.com/problems/constrained-subsequence-sum
带限制的子序列和https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md
1426https://leetcode-cn.com/problems/counting-elements
数元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1426.Counting%20Elements/README.md
1428https://leetcode-cn.com/problems/leftmost-column-with-at-least-a-one
至少有一个 1 的最左端列https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md
1429https://leetcode-cn.com/problems/first-unique-number
第一个唯一数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1429.First%20Unique%20Number/README.md
1430https://leetcode-cn.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree
判断给定的序列是否是二叉树从根到叶的路径https://github.com/CPythoner/leetcode-1/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
1431https://leetcode-cn.com/problems/kids-with-the-greatest-number-of-candies
拥有最多糖果的孩子https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md
1432https://leetcode-cn.com/problems/max-difference-you-can-get-from-changing-an-integer
改变一个整数能得到的最大差值https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md
1433https://leetcode-cn.com/problems/check-if-a-string-can-break-another-string
检查一个字符串是否可以打破另一个字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md
1434https://leetcode-cn.com/problems/number-of-ways-to-wear-different-hats-to-each-other
每个人戴不同帽子的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md
1436https://leetcode-cn.com/problems/destination-city
旅行终点站https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1436.Destination%20City/README.md
1437https://leetcode-cn.com/problems/check-if-all-1s-are-at-least-length-k-places-away
是否所有 1 都至少相隔 k 个元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md
1438https://leetcode-cn.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
绝对差不超过限制的最长连续子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md
1439https://leetcode-cn.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows
有序矩阵中的第 k 个最小数组和https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md
1441https://leetcode-cn.com/problems/build-an-array-with-stack-operations
用栈操作构建数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md
1442https://leetcode-cn.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor
形成两个异或相等数组的三元组数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md
1443https://leetcode-cn.com/problems/minimum-time-to-collect-all-apples-in-a-tree
收集树上所有苹果的最少时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md
1444https://leetcode-cn.com/problems/number-of-ways-of-cutting-a-pizza
切披萨的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md
1446https://leetcode-cn.com/problems/consecutive-characters
连续字符https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1446.Consecutive%20Characters/README.md
1447https://leetcode-cn.com/problems/simplified-fractions
最简分数https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1447.Simplified%20Fractions/README.md
1448https://leetcode-cn.com/problems/count-good-nodes-in-binary-tree
统计二叉树中好节点的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md
1449https://leetcode-cn.com/problems/form-largest-integer-with-digits-that-add-up-to-target
数位成本和为目标值的最大数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md
1474https://leetcode-cn.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list
删除链表 M 个节点之后的 N 个节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md
1483https://leetcode-cn.com/problems/kth-ancestor-of-a-tree-node
树节点的第 K 个祖先https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md
1490https://leetcode-cn.com/problems/clone-n-ary-tree
克隆 N 叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md
1495https://leetcode-cn.com/problems/friendly-movies-streamed-last-month
上月播放的儿童适宜电影https://github.com/CPythoner/leetcode-1/blob/main/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md
1500https://leetcode-cn.com/problems/design-a-file-sharing-system
设计文件分享系统https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md
1501https://leetcode-cn.com/problems/countries-you-can-safely-invest-in
可以放心投资的国家https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md
1506https://leetcode-cn.com/problems/find-root-of-n-ary-tree
找到 N 叉树的根节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md
1507https://leetcode-cn.com/problems/reformat-date
转变日期格式https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1507.Reformat%20Date/README.md
1511https://leetcode-cn.com/problems/customer-order-frequency
消费者下单频率https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md
1512https://leetcode-cn.com/problems/number-of-good-pairs
好数对的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md
1513https://leetcode-cn.com/problems/number-of-substrings-with-only-1s
仅含 1 的子串数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md
1515https://leetcode-cn.com/problems/best-position-for-a-service-centre
服务中心的最佳位置https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md
1516https://leetcode-cn.com/problems/move-sub-tree-of-n-ary-tree
移动 N 叉树的子树https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md
1517https://leetcode-cn.com/problems/find-users-with-valid-e-mails
查找拥有有效邮箱的用户https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md
1518https://leetcode-cn.com/problems/water-bottles
换酒问题https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1518.Water%20Bottles/README.md
1519https://leetcode-cn.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label
子树中标签相同的节点数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md
1520https://leetcode-cn.com/problems/maximum-number-of-non-overlapping-substrings
最多的不重叠子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md
1521https://leetcode-cn.com/problems/find-a-value-of-a-mysterious-function-closest-to-target
找到最接近目标值的函数值https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md
1522https://leetcode-cn.com/problems/diameter-of-n-ary-tree
N 叉树的直径https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md
1526https://leetcode-cn.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array
形成目标数组的子数组最少增加次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md
1527https://leetcode-cn.com/problems/patients-with-a-condition
患某种疾病的患者https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md
1528https://leetcode-cn.com/problems/shuffle-string
重新排列字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1528.Shuffle%20String/README.md
1529https://leetcode-cn.com/problems/bulb-switcher-iv
灯泡开关 IVhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1529.Bulb%20Switcher%20IV/README.md
1530https://leetcode-cn.com/problems/number-of-good-leaf-nodes-pairs
好叶子节点对的数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md
1531https://leetcode-cn.com/problems/string-compression-ii
压缩字符串 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1531.String%20Compression%20II/README.md
1532https://leetcode-cn.com/problems/the-most-recent-three-orders
最近的三笔订单https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md
1533https://leetcode-cn.com/problems/find-the-index-of-the-large-integer
找到最大整数的索引https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md
1534https://leetcode-cn.com/problems/count-good-triplets
统计好三元组https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1534.Count%20Good%20Triplets/README.md
1535https://leetcode-cn.com/problems/find-the-winner-of-an-array-game
找出数组游戏的赢家https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md
1536https://leetcode-cn.com/problems/minimum-swaps-to-arrange-a-binary-grid
排布二进制网格的最少交换次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md
1537https://leetcode-cn.com/problems/get-the-maximum-score
最大得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md
1539https://leetcode-cn.com/problems/kth-missing-positive-number
第 k 个缺失的正整数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md
1540https://leetcode-cn.com/problems/can-convert-string-in-k-moves
K 次操作转变字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md
1541https://leetcode-cn.com/problems/minimum-insertions-to-balance-a-parentheses-string
平衡括号字符串的最少插入次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md
1542https://leetcode-cn.com/problems/find-longest-awesome-substring
找出最长的超赞子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md
1544https://leetcode-cn.com/problems/make-the-string-great
整理字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1544.Make%20The%20String%20Great/README.md
1545https://leetcode-cn.com/problems/find-kth-bit-in-nth-binary-string
找出第 N 个二进制字符串中的第 K 位https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md
1546https://leetcode-cn.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target
和为目标值且不重叠的非空子数组的最大数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md
1547https://leetcode-cn.com/problems/minimum-cost-to-cut-a-stick
切棍子的最小成本https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md
1550https://leetcode-cn.com/problems/three-consecutive-odds
存在连续三个奇数的数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md
1554https://leetcode-cn.com/problems/strings-differ-by-one-character
只有一个不同字符的字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md
1555https://leetcode-cn.com/problems/bank-account-summary
银行账户概要https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1555.Bank%20Account%20Summary/README.md
1556https://leetcode-cn.com/problems/thousand-separator
千位分隔数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1556.Thousand%20Separator/README.md
1557https://leetcode-cn.com/problems/minimum-number-of-vertices-to-reach-all-nodes
可以到达所有点的最少点数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md
1558https://leetcode-cn.com/problems/minimum-numbers-of-function-calls-to-make-target-array
得到目标数组的最少函数调用次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md
1559https://leetcode-cn.com/problems/detect-cycles-in-2d-grid
二维网格图中探测环https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md
1564https://leetcode-cn.com/problems/put-boxes-into-the-warehouse-i
把箱子放进仓库里 Ihttps://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md
1565https://leetcode-cn.com/problems/unique-orders-and-customers-per-month
按月统计订单数与顾客数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md
1568https://leetcode-cn.com/problems/minimum-number-of-days-to-disconnect-island
使陆地分离的最少天数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md
1569https://leetcode-cn.com/problems/number-of-ways-to-reorder-array-to-get-same-bst
将子数组重新排序得到同一个二叉查找树的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md
1570https://leetcode-cn.com/problems/dot-product-of-two-sparse-vectors
两个稀疏向量的点积https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md
1571https://leetcode-cn.com/problems/warehouse-manager
仓库经理https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1571.Warehouse%20Manager/README.md
1576https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters
替换所有的问号https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md
1577https://leetcode-cn.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers
数的平方等于两数乘积的方法数https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md
1578https://leetcode-cn.com/problems/minimum-deletion-cost-to-avoid-repeating-letters
避免重复字母的最小删除成本https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README.md
1579https://leetcode-cn.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable
保证图可完全遍历https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md
1580https://leetcode-cn.com/problems/put-boxes-into-the-warehouse-ii
把箱子放进仓库里 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md
1582https://leetcode-cn.com/problems/special-positions-in-a-binary-matrix
二进制矩阵中的特殊位置https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md
1583https://leetcode-cn.com/problems/count-unhappy-friends
统计不开心的朋友https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md
1584https://leetcode-cn.com/problems/min-cost-to-connect-all-points
连接所有点的最小费用https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md
1585https://leetcode-cn.com/problems/check-if-string-is-transformable-with-substring-sort-operations
检查字符串是否可以通过排序子字符串得到另一个字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md
1588https://leetcode-cn.com/problems/sum-of-all-odd-length-subarrays
所有奇数长度子数组的和https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md
1589https://leetcode-cn.com/problems/maximum-sum-obtained-of-any-permutation
所有排列中的最大和https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md
1590https://leetcode-cn.com/problems/make-sum-divisible-by-p
使数组和能被 P 整除https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md
1591https://leetcode-cn.com/problems/strange-printer-ii
奇怪的打印机 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1591.Strange%20Printer%20II/README.md
1592https://leetcode-cn.com/problems/rearrange-spaces-between-words
重新排列单词间的空格https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md
1593https://leetcode-cn.com/problems/split-a-string-into-the-max-number-of-unique-substrings
拆分字符串使唯一子字符串的数目最大https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md
1594https://leetcode-cn.com/problems/maximum-non-negative-product-in-a-matrix
矩阵的最大非负积https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md
1595https://leetcode-cn.com/problems/minimum-cost-to-connect-two-groups-of-points
连通两组点的最小成本https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md
1598https://leetcode-cn.com/problems/crawler-log-folder
文件夹操作日志搜集器https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md
1599https://leetcode-cn.com/problems/maximum-profit-of-operating-a-centennial-wheel
经营摩天轮的最大利润https://github.com/CPythoner/leetcode-1/blob/main/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md
1600https://leetcode-cn.com/problems/throne-inheritance
皇位继承顺序https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1600.Throne%20Inheritance/README.md
1601https://leetcode-cn.com/problems/maximum-number-of-achievable-transfer-requests
最多可达成的换楼请求数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md
1603https://leetcode-cn.com/problems/design-parking-system
设计停车系统https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1603.Design%20Parking%20System/README.md
1604https://leetcode-cn.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period
警告一小时内使用相同员工卡大于等于三次的人https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md
1605https://leetcode-cn.com/problems/find-valid-matrix-given-row-and-column-sums
给定行和列的和求可行矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md
1606https://leetcode-cn.com/problems/find-servers-that-handled-most-number-of-requests
找到处理最多请求的服务器https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md
1614https://leetcode-cn.com/problems/maximum-nesting-depth-of-the-parentheses
括号的最大嵌套深度https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md
1618https://leetcode-cn.com/problems/maximum-font-to-fit-a-sentence-in-a-screen
找出适应屏幕的最大字号https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md
1619https://leetcode-cn.com/problems/mean-of-array-after-removing-some-elements
删除某些元素后的数组均值https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md
1627https://leetcode-cn.com/problems/graph-connectivity-with-threshold
带阈值的图连通性https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md
1632https://leetcode-cn.com/problems/rank-transform-of-a-matrix
矩阵转换后的秩https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md
1640https://leetcode-cn.com/problems/check-array-formation-through-concatenation
能否连接形成数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md
1651https://leetcode-cn.com/problems/hopper-company-queries-iii
Hopper Company Queries IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md
1660https://leetcode-cn.com/problems/correct-a-binary-tree
纠正二叉树https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md
1661https://leetcode-cn.com/problems/average-time-of-process-per-machine
每台机器的进程平均运行时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md
1662https://leetcode-cn.com/problems/check-if-two-string-arrays-are-equivalent
检查两个字符串数组是否相等https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md
1666https://leetcode-cn.com/problems/change-the-root-of-a-binary-tree
改变二叉树的根节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md
1667https://leetcode-cn.com/problems/fix-names-in-a-table
修复表中的名字https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md
1676https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree-iv
二叉树的最近公共祖先 IVhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md
1677https://leetcode-cn.com/problems/products-worth-over-invoices
发票中的产品金额https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md
1678https://leetcode-cn.com/problems/goal-parser-interpretation
设计 Goal 解析器https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md
1679https://leetcode-cn.com/problems/max-number-of-k-sum-pairs
K 和数对的最大数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md
1680https://leetcode-cn.com/problems/concatenation-of-consecutive-binary-numbers
连接连续二进制数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md
1681https://leetcode-cn.com/problems/minimum-incompatibility
最小不兼容性https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1681.Minimum%20Incompatibility/README.md
1682https://leetcode-cn.com/problems/longest-palindromic-subsequence-ii
最长回文子序列 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md
1688https://leetcode-cn.com/problems/count-of-matches-in-tournament
比赛中的配对次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md
1689https://leetcode-cn.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers
十-二进制数的最少数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md
1690https://leetcode-cn.com/problems/stone-game-vii
石子游戏 VIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1690.Stone%20Game%20VII/README.md
1691https://leetcode-cn.com/problems/maximum-height-by-stacking-cuboids
堆叠长方体的最大高度https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md
1693https://leetcode-cn.com/problems/daily-leads-and-partners
每天的领导和合伙人https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md
1694https://leetcode-cn.com/problems/reformat-phone-number
重新格式化电话号码https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md
1695https://leetcode-cn.com/problems/maximum-erasure-value
删除子数组的最大得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md
1696https://leetcode-cn.com/problems/jump-game-vi
跳跃游戏 VIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1696.Jump%20Game%20VI/README.md
1697https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths
检查边长度限制的路径是否存在https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md
1698https://leetcode-cn.com/problems/number-of-distinct-substrings-in-a-string
字符串的不同子字符串个数https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md
1699https://leetcode-cn.com/problems/number-of-calls-between-two-persons
两人之间的通话次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md
1700https://leetcode-cn.com/problems/number-of-students-unable-to-eat-lunch
无法吃午餐的学生数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md
1701https://leetcode-cn.com/problems/average-waiting-time
平均等待时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1701.Average%20Waiting%20Time/README.md
1702https://leetcode-cn.com/problems/maximum-binary-string-after-change
修改后的最大二进制字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md
1703https://leetcode-cn.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones
得到连续 K 个 1 的最少相邻交换次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md
1704https://leetcode-cn.com/problems/determine-if-string-halves-are-alike
判断字符串的两半是否相似https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md
1705https://leetcode-cn.com/problems/maximum-number-of-eaten-apples
吃苹果的最大数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md
1707https://leetcode-cn.com/problems/maximum-xor-with-an-element-from-array
与数组中元素的最大异或值https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md
1708https://leetcode-cn.com/problems/largest-subarray-length-k
长度为 K 的最大子数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md
1709https://leetcode-cn.com/problems/biggest-window-between-visits
访问日期之间最大的空档期https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md
1714https://leetcode-cn.com/problems/sum-of-special-evenly-spaced-elements-in-array
数组中特殊等间距元素的和https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md
1715https://leetcode-cn.com/problems/count-apples-and-oranges
苹果和橘子的个数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md
1716https://leetcode-cn.com/problems/calculate-money-in-leetcode-bank
计算力扣银行的钱https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md
1717https://leetcode-cn.com/problems/maximum-score-from-removing-substrings
删除子字符串的最大得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md
1718https://leetcode-cn.com/problems/construct-the-lexicographically-largest-valid-sequence
构建字典序最大的可行序列https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md
1719https://leetcode-cn.com/problems/number-of-ways-to-reconstruct-a-tree
重构一棵树的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md
1720https://leetcode-cn.com/problems/decode-xored-array
解码异或后的数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1720.Decode%20XORed%20Array/README.md
1721https://leetcode-cn.com/problems/swapping-nodes-in-a-linked-list
交换链表中的节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md
1722https://leetcode-cn.com/problems/minimize-hamming-distance-after-swap-operations
执行交换操作后的最小汉明距离https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md
1724https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths-ii
检查边长度限制的路径是否存在 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md
1725https://leetcode-cn.com/problems/number-of-rectangles-that-can-form-the-largest-square
可以形成最大正方形的矩形数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md
1726https://leetcode-cn.com/problems/tuple-with-same-product
同积元组https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md
1727https://leetcode-cn.com/problems/largest-submatrix-with-rearrangements
重新排列后的最大子矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md
1729https://leetcode-cn.com/problems/find-followers-count
求关注者的数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1729.Find%20Followers%20Count/README.md
1730https://leetcode-cn.com/problems/shortest-path-to-get-food
获取食物的最短路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md
1731https://leetcode-cn.com/problems/the-number-of-employees-which-report-to-each-employee
每位经理的下属员工数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md
1733https://leetcode-cn.com/problems/minimum-number-of-people-to-teach
需要教语言的最少人数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md
1734https://leetcode-cn.com/problems/decode-xored-permutation
解码异或后的排列https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md
1735https://leetcode-cn.com/problems/count-ways-to-make-array-with-product
生成乘积数组的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md
1736https://leetcode-cn.com/problems/latest-time-by-replacing-hidden-digits
替换隐藏数字得到的最晚时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md
1737https://leetcode-cn.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions
满足三条件之一需改变的最少字符数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md
1738https://leetcode-cn.com/problems/find-kth-largest-xor-coordinate-value
找出第 K 大的异或坐标值https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md
1739https://leetcode-cn.com/problems/building-boxes
放置盒子https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1739.Building%20Boxes/README.md
1740https://leetcode-cn.com/problems/find-distance-in-a-binary-tree
找到二叉树中的距离https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md
1742https://leetcode-cn.com/problems/maximum-number-of-balls-in-a-box
盒子中小球的最大数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md
1743https://leetcode-cn.com/problems/restore-the-array-from-adjacent-pairs
从相邻元素对还原数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md
1744https://leetcode-cn.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day
你能在你最喜欢的那天吃到你最喜欢的糖果吗？https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md
1745https://leetcode-cn.com/problems/palindrome-partitioning-iv
回文串分割 IVhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md
1747https://leetcode-cn.com/problems/leetflex-banned-accounts
应该被禁止的Leetflex账户https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md
1748https://leetcode-cn.com/problems/sum-of-unique-elements
唯一元素的和https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md
1749https://leetcode-cn.com/problems/maximum-absolute-sum-of-any-subarray
任意子数组和的绝对值的最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md
1750https://leetcode-cn.com/problems/minimum-length-of-string-after-deleting-similar-ends
删除字符串两端相同字符后的最短长度https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md
1751https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended-ii
最多可以参加的会议数目 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md
1752https://leetcode-cn.com/problems/check-if-array-is-sorted-and-rotated
检查数组是否经排序和轮转得到https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md
1753https://leetcode-cn.com/problems/maximum-score-from-removing-stones
移除石子的最大得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md
1754https://leetcode-cn.com/problems/largest-merge-of-two-strings
构造字典序最大的合并字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md
1755https://leetcode-cn.com/problems/closest-subsequence-sum
最接近目标值的子序列和https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md
1756https://leetcode-cn.com/problems/design-most-recently-used-queue
设计最近使用（MRU）队列https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md
1757https://leetcode-cn.com/problems/recyclable-and-low-fat-products
可回收且低脂的产品https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md
1758https://leetcode-cn.com/problems/minimum-changes-to-make-alternating-binary-string
生成交替二进制字符串的最少操作数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md
1759https://leetcode-cn.com/problems/count-number-of-homogenous-substrings
统计同构子字符串的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md
1760https://leetcode-cn.com/problems/minimum-limit-of-balls-in-a-bag
袋子里最少数目的球https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md
1761https://leetcode-cn.com/problems/minimum-degree-of-a-connected-trio-in-a-graph
一个图中连通三元组的最小度数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md
1762https://leetcode-cn.com/problems/buildings-with-an-ocean-view
能看到海景的建筑物https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md
1763https://leetcode-cn.com/problems/longest-nice-substring
最长的美好子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md
1764https://leetcode-cn.com/problems/form-array-by-concatenating-subarrays-of-another-array
通过连接另一个数组的子数组得到一个数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md
1765https://leetcode-cn.com/problems/map-of-highest-peak
地图中的最高点https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md
1766https://leetcode-cn.com/problems/tree-of-coprimes
互质树https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md
1767https://leetcode-cn.com/problems/find-the-subtasks-that-did-not-execute
寻找没有被执行的任务对https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md
1769https://leetcode-cn.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box
移动所有球到每个盒子所需的最小操作数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md
1772https://leetcode-cn.com/problems/sort-features-by-popularity
按受欢迎程度排列功能https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md
1773https://leetcode-cn.com/problems/count-items-matching-a-rule
统计匹配检索规则的物品数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md
1774https://leetcode-cn.com/problems/closest-dessert-cost
最接近目标价格的甜点成本https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md
1775https://leetcode-cn.com/problems/equal-sum-arrays-with-minimum-number-of-operations
通过最少操作次数使数组的和相等https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md
1776https://leetcode-cn.com/problems/car-fleet-ii
车队 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1776.Car%20Fleet%20II/README.md
1777https://leetcode-cn.com/problems/products-price-for-each-store
每家商店的产品价格https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md
1778https://leetcode-cn.com/problems/shortest-path-in-a-hidden-grid
未知网格中的最短路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md
1783https://leetcode-cn.com/problems/grand-slam-titles
大满贯数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md
1784https://leetcode-cn.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones
检查二进制字符串字段https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md
1785https://leetcode-cn.com/problems/minimum-elements-to-add-to-form-a-given-sum
构成特定和需要添加的最少元素https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md
1786https://leetcode-cn.com/problems/number-of-restricted-paths-from-first-to-last-node
从第一个节点出发到最后一个节点的受限路径数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md
1787https://leetcode-cn.com/problems/make-the-xor-of-all-segments-equal-to-zero
使所有区间的异或结果为零https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md
1788https://leetcode-cn.com/problems/maximize-the-beauty-of-the-garden
最大化花园的美观度https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md
1790https://leetcode-cn.com/problems/check-if-one-string-swap-can-make-strings-equal
仅执行一次字符串交换能否使两个字符串相等https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md
1791https://leetcode-cn.com/problems/find-center-of-star-graph
找出星型图的中心节点https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md
1792https://leetcode-cn.com/problems/maximum-average-pass-ratio
最大平均通过率https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md
1793https://leetcode-cn.com/problems/maximum-score-of-a-good-subarray
好子数组的最大分数https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md
1796https://leetcode-cn.com/problems/second-largest-digit-in-a-string
字符串中第二大的数字https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md
1797https://leetcode-cn.com/problems/design-authentication-manager
设计一个验证系统https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md
1798https://leetcode-cn.com/problems/maximum-number-of-consecutive-values-you-can-make
你能构造出连续值的最大数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md
1799https://leetcode-cn.com/problems/maximize-score-after-n-operations
N 次操作后的最大分数和https://github.com/CPythoner/leetcode-1/blob/main/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md
1800https://leetcode-cn.com/problems/maximum-ascending-subarray-sum
最大升序子数组和https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md
1801https://leetcode-cn.com/problems/number-of-orders-in-the-backlog
积压订单中的订单总数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md
1802https://leetcode-cn.com/problems/maximum-value-at-a-given-index-in-a-bounded-array
有界数组中指定下标处的最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md
1803https://leetcode-cn.com/problems/count-pairs-with-xor-in-a-range
统计异或值在范围内的数对有多少https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md
1805https://leetcode-cn.com/problems/number-of-different-integers-in-a-string
字符串中不同整数的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md
1806https://leetcode-cn.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation
还原排列的最少操作步数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md
1807https://leetcode-cn.com/problems/evaluate-the-bracket-pairs-of-a-string
替换字符串中的括号内容https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md
1808https://leetcode-cn.com/problems/maximize-number-of-nice-divisors
好因子的最大数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md
1812https://leetcode-cn.com/problems/determine-color-of-a-chessboard-square
判断国际象棋棋盘中一个格子的颜色https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md
1813https://leetcode-cn.com/problems/sentence-similarity-iii
句子相似性 IIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md
1814https://leetcode-cn.com/problems/count-nice-pairs-in-an-array
统计一个数组中好对子的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md
1815https://leetcode-cn.com/problems/maximum-number-of-groups-getting-fresh-donuts
得到新鲜甜甜圈的最多组数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md
1827https://leetcode-cn.com/problems/minimum-operations-to-make-the-array-increasing
最少操作使数组递增https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md
1828https://leetcode-cn.com/problems/queries-on-number-of-points-inside-a-circle
统计一个圆中点的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md
1830https://leetcode-cn.com/problems/minimum-number-of-operations-to-make-string-sorted
使字符串有序的最少操作次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md
1839https://leetcode-cn.com/problems/longest-substring-of-all-vowels-in-order
所有元音按顺序排布的最长子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md
1852https://leetcode-cn.com/problems/distinct-numbers-in-each-subarray
每个子数组的数字种类数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md
1853https://leetcode-cn.com/problems/convert-date-format
转换日期格式https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1853.Convert%20Date%20Format/README.md
1858https://leetcode-cn.com/problems/longest-word-with-all-prefixes
包含所有前缀的最长单词https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md
1867https://leetcode-cn.com/problems/orders-with-maximum-quantity-above-average
Orders With Maximum Quantity Above Averagehttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md
1868https://leetcode-cn.com/problems/product-of-two-run-length-encoded-arrays
两个行程编码数组的积https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md
1871https://leetcode-cn.com/problems/jump-game-vii
跳跃游戏 VIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1871.Jump%20Game%20VII/README.md
1872https://leetcode-cn.com/problems/stone-game-viii
石子游戏 VIIIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1872.Stone%20Game%20VIII/README.md
1873https://leetcode-cn.com/problems/calculate-special-bonus
计算特殊奖金https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md
1874https://leetcode-cn.com/problems/minimize-product-sum-of-two-arrays
两个数组的最小乘积和https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md
1875https://leetcode-cn.com/problems/group-employees-of-the-same-salary
Group Employees of the Same Salaryhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md
1880https://leetcode-cn.com/problems/check-if-word-equals-summation-of-two-words
检查某单词是否等于两单词之和https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md
1881https://leetcode-cn.com/problems/maximum-value-after-insertion
插入后的最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md
1882https://leetcode-cn.com/problems/process-tasks-using-servers
使用服务器处理任务https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md
1883https://leetcode-cn.com/problems/minimum-skips-to-arrive-at-meeting-on-time
准时抵达会议现场的最小跳过休息次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md
1884https://leetcode-cn.com/problems/egg-drop-with-2-eggs-and-n-floors
鸡蛋掉落-两枚鸡蛋https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md
1885https://leetcode-cn.com/problems/count-pairs-in-two-arrays
Count Pairs in Two Arrayshttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md
1886https://leetcode-cn.com/problems/determine-whether-matrix-can-be-obtained-by-rotation
判断矩阵经轮转后是否一致https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md
1887https://leetcode-cn.com/problems/reduction-operations-to-make-the-array-elements-equal
使数组元素相等的减少操作次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md
1888https://leetcode-cn.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating
使二进制字符串字符交替的最少反转次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md
1889https://leetcode-cn.com/problems/minimum-space-wasted-from-packaging
装包裹的最小浪费空间https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md
1890https://leetcode-cn.com/problems/the-latest-login-in-2020
2020年最后一次登录https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md
1891https://leetcode-cn.com/problems/cutting-ribbons
割绳子https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1891.Cutting%20Ribbons/README.md
1892https://leetcode-cn.com/problems/page-recommendations-ii
页面推荐Ⅱhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1892.Page%20Recommendations%20II/README.md
1893https://leetcode-cn.com/problems/check-if-all-the-integers-in-a-range-are-covered
检查是否区域内所有整数都被覆盖https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md
1894https://leetcode-cn.com/problems/find-the-student-that-will-replace-the-chalk
找到需要补充粉笔的学生编号https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md
1895https://leetcode-cn.com/problems/largest-magic-square
最大的幻方https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1895.Largest%20Magic%20Square/README.md
1896https://leetcode-cn.com/problems/minimum-cost-to-change-the-final-value-of-expression
反转表达式值的最少操作次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md
1897https://leetcode-cn.com/problems/redistribute-characters-to-make-all-strings-equal
重新分配字符使所有字符串都相等https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md
1898https://leetcode-cn.com/problems/maximum-number-of-removable-characters
可移除字符的最大数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md
1899https://leetcode-cn.com/problems/merge-triplets-to-form-target-triplet
合并若干三元组以形成目标三元组https://github.com/CPythoner/leetcode-1/blob/main/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md
1900https://leetcode-cn.com/problems/the-earliest-and-latest-rounds-where-players-compete
最佳运动员的比拼回合https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md
1901https://leetcode-cn.com/problems/find-a-peak-element-ii
找出顶峰元素 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README.md
1902https://leetcode-cn.com/problems/depth-of-bst-given-insertion-order
Depth of BST Given Insertion Orderhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md
1903https://leetcode-cn.com/problems/largest-odd-number-in-string
字符串中的最大奇数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md
1904https://leetcode-cn.com/problems/the-number-of-full-rounds-you-have-played
你完成的完整对局数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md
1905https://leetcode-cn.com/problems/count-sub-islands
统计子岛屿https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1905.Count%20Sub%20Islands/README.md
1906https://leetcode-cn.com/problems/minimum-absolute-difference-queries
查询差绝对值的最小值https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md
1907https://leetcode-cn.com/problems/count-salary-categories
按分类统计薪水https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1907.Count%20Salary%20Categories/README.md
1908https://leetcode-cn.com/problems/game-of-nim
Nim 游戏 IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1908.Game%20of%20Nim/README.md
1909https://leetcode-cn.com/problems/remove-one-element-to-make-the-array-strictly-increasing
删除一个元素使数组严格递增https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md
1910https://leetcode-cn.com/problems/remove-all-occurrences-of-a-substring
删除一个字符串中所有出现的给定子字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md
1911https://leetcode-cn.com/problems/maximum-alternating-subsequence-sum
最大子序列交替和https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md
1912https://leetcode-cn.com/problems/design-movie-rental-system
设计电影租借系统https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md
1913https://leetcode-cn.com/problems/maximum-product-difference-between-two-pairs
两个数对之间的最大乘积差https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md
1914https://leetcode-cn.com/problems/cyclically-rotating-a-grid
循环轮转矩阵https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md
1915https://leetcode-cn.com/problems/number-of-wonderful-substrings
最美子字符串的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md
1916https://leetcode-cn.com/problems/count-ways-to-build-rooms-in-an-ant-colony
统计为蚁群构筑房间的不同顺序https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md
1917https://leetcode-cn.com/problems/leetcodify-friends-recommendations
Leetcodify Friends Recommendationshttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md
1918https://leetcode-cn.com/problems/kth-smallest-subarray-sum
第 K 小的子序列和https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md
1919https://leetcode-cn.com/problems/leetcodify-similar-friends
兴趣相同的朋友https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md
1920https://leetcode-cn.com/problems/build-array-from-permutation
基于排列构建数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md
1921https://leetcode-cn.com/problems/eliminate-maximum-number-of-monsters
消灭怪物的最大数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md
1922https://leetcode-cn.com/problems/count-good-numbers
统计好数字的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1922.Count%20Good%20Numbers/README.md
1923https://leetcode-cn.com/problems/longest-common-subpath
最长公共子路径https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md
1924https://leetcode-cn.com/problems/erect-the-fence-ii
Erect the Fence IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md
1925https://leetcode-cn.com/problems/count-square-sum-triples
统计平方和三元组的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md
1926https://leetcode-cn.com/problems/nearest-exit-from-entrance-in-maze
迷宫中离入口最近的出口https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md
1927https://leetcode-cn.com/problems/sum-game
求和游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1927.Sum%20Game/README.md
1928https://leetcode-cn.com/problems/minimum-cost-to-reach-destination-in-time
规定时间内到达终点的最小花费https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md
1929https://leetcode-cn.com/problems/concatenation-of-array
数组串联https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1929.Concatenation%20of%20Array/README.md
1930https://leetcode-cn.com/problems/unique-length-3-palindromic-subsequences
长度为 3 的不同回文子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md
1931https://leetcode-cn.com/problems/painting-a-grid-with-three-different-colors
用三种不同颜色为网格涂色https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md
1932https://leetcode-cn.com/problems/merge-bsts-to-create-single-bst
合并多棵二叉搜索树https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md
1933https://leetcode-cn.com/problems/check-if-string-is-decomposable-into-value-equal-substrings
判断字符串是否可分解为值均等的子串https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md
1934https://leetcode-cn.com/problems/confirmation-rate
Confirmation Ratehttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1934.Confirmation%20Rate/README.md
1935https://leetcode-cn.com/problems/maximum-number-of-words-you-can-type
可以输入的最大单词数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md
1936https://leetcode-cn.com/problems/add-minimum-number-of-rungs
新增的最少台阶数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md
1937https://leetcode-cn.com/problems/maximum-number-of-points-with-cost
扣分后的最大得分https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md
1938https://leetcode-cn.com/problems/maximum-genetic-difference-query
查询最大基因差https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md
1939https://leetcode-cn.com/problems/users-that-actively-request-confirmation-messages
Users That Actively Request Confirmation Messageshttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md
1940https://leetcode-cn.com/problems/longest-common-subsequence-between-sorted-arrays
排序数组之间的最长公共子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md
1941https://leetcode-cn.com/problems/check-if-all-characters-have-equal-number-of-occurrences
检查是否所有字符出现次数相同https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md
1942https://leetcode-cn.com/problems/the-number-of-the-smallest-unoccupied-chair
最小未被占据椅子的编号https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md
1943https://leetcode-cn.com/problems/describe-the-painting
描述绘画结果https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1943.Describe%20the%20Painting/README.md
1944https://leetcode-cn.com/problems/number-of-visible-people-in-a-queue
队列中可以看到的人数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md
1945https://leetcode-cn.com/problems/sum-of-digits-of-string-after-convert
字符串转化后的各位数字之和https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md
1946https://leetcode-cn.com/problems/largest-number-after-mutating-substring
子字符串突变后可能得到的最大整数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md
1947https://leetcode-cn.com/problems/maximum-compatibility-score-sum
最大兼容性评分和https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md
1948https://leetcode-cn.com/problems/delete-duplicate-folders-in-system
删除系统中的重复文件夹https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md
1949https://leetcode-cn.com/problems/strong-friendship
Strong Friendshiphttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1949.Strong%20Friendship/README.md
1950https://leetcode-cn.com/problems/maximum-of-minimum-values-in-all-subarrays
所有子数组最小值中的最大值https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md
1951https://leetcode-cn.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers
查询具有最多共同关注者的所有两两结对组https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md
1952https://leetcode-cn.com/problems/three-divisors
三除数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1952.Three%20Divisors/README.md
1953https://leetcode-cn.com/problems/maximum-number-of-weeks-for-which-you-can-work
你可以工作的最大周数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md
1954https://leetcode-cn.com/problems/minimum-garden-perimeter-to-collect-enough-apples
收集足够苹果的最小花园周长https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md
1955https://leetcode-cn.com/problems/count-number-of-special-subsequences
统计特殊子序列的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md
1956https://leetcode-cn.com/problems/minimum-time-for-k-virus-variants-to-spread
感染 K 种病毒所需的最短时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md
1957https://leetcode-cn.com/problems/delete-characters-to-make-fancy-string
删除字符使字符串变好https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md
1958https://leetcode-cn.com/problems/check-if-move-is-legal
检查操作是否合法https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md
1959https://leetcode-cn.com/problems/minimum-total-space-wasted-with-k-resizing-operations
K 次调整数组大小浪费的最小总空间https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md
1961https://leetcode-cn.com/problems/check-if-string-is-a-prefix-of-array
检查字符串是否为数组前缀https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md
1962https://leetcode-cn.com/problems/remove-stones-to-minimize-the-total
移除石子使总数最小https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md
1963https://leetcode-cn.com/problems/minimum-number-of-swaps-to-make-the-string-balanced
使字符串平衡的最小交换次数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md
1964https://leetcode-cn.com/problems/find-the-longest-valid-obstacle-course-at-each-position
找出到每个位置为止最长的有效障碍赛跑路线https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md
1965https://leetcode-cn.com/problems/employees-with-missing-information
Employees With Missing Informationhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README.md
1966https://leetcode-cn.com/problems/binary-searchable-numbers-in-an-unsorted-array
Binary Searchable Numbers in an Unsorted Arrayhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md
1967https://leetcode-cn.com/problems/number-of-strings-that-appear-as-substrings-in-word
作为子字符串出现在单词中的字符串数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md
1968https://leetcode-cn.com/problems/array-with-elements-not-equal-to-average-of-neighbors
构造元素不等于两相邻元素平均值的数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md
1969https://leetcode-cn.com/problems/minimum-non-zero-product-of-the-array-elements
数组元素的最小非零乘积https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md
1970https://leetcode-cn.com/problems/last-day-where-you-can-still-cross
你能穿过矩阵的最后一天https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md
1971https://leetcode-cn.com/problems/find-if-path-exists-in-graph
Find if Path Exists in Graphhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README.md
1972https://leetcode-cn.com/problems/first-and-last-call-on-the-same-day
First and Last Call On the Same Dayhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md
1973https://leetcode-cn.com/problems/count-nodes-equal-to-sum-of-descendants
Count Nodes Equal to Sum of Descendantshttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md
1974https://leetcode-cn.com/problems/minimum-time-to-type-word-using-special-typewriter
使用特殊打字机键入单词的最少时间https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md
1975https://leetcode-cn.com/problems/maximum-matrix-sum
最大方阵和https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md
1976https://leetcode-cn.com/problems/number-of-ways-to-arrive-at-destination
到达目的地的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md
1977https://leetcode-cn.com/problems/number-of-ways-to-separate-numbers
划分数字的方案数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md
1978https://leetcode-cn.com/problems/employees-whose-manager-left-the-company
Employees Whose Manager Left the Companyhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README.md
1979https://leetcode-cn.com/problems/find-greatest-common-divisor-of-array
找出数组的最大公约数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md
1980https://leetcode-cn.com/problems/find-unique-binary-string
找出不同的二进制字符串https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md
1981https://leetcode-cn.com/problems/minimize-the-difference-between-target-and-chosen-elements
最小化目标值与所选元素的差https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md
1982https://leetcode-cn.com/problems/find-array-given-subset-sums
从子集的和还原数组https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md
1983https://leetcode-cn.com/problems/widest-pair-of-indices-with-equal-range-sum
Widest Pair of Indices With Equal Range Sumhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md
1984https://leetcode-cn.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores
学生分数的最小差值https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md
1985https://leetcode-cn.com/problems/find-the-kth-largest-integer-in-the-array
找出数组中的第 K 大整数https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md
1986https://leetcode-cn.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks
完成任务的最少工作时间段https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md
1987https://leetcode-cn.com/problems/number-of-unique-good-subsequences
不同的好子序列数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md
1988https://leetcode-cn.com/problems/find-cutoff-score-for-each-school
Find Cutoff Score for Each Schoolhttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md
1990https://leetcode-cn.com/problems/count-the-number-of-experiments
Count the Number of Experimentshttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md
1991https://leetcode-cn.com/problems/find-the-middle-index-in-array
找到数组的中间位置https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md
1992https://leetcode-cn.com/problems/find-all-groups-of-farmland
找到所有的农场组https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md
1993https://leetcode-cn.com/problems/operations-on-tree
树上的操作https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1993.Operations%20on%20Tree/README.md
1994https://leetcode-cn.com/problems/the-number-of-good-subsets
好子集的数目https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md
1995https://leetcode-cn.com/problems/count-special-quadruplets
统计特殊四元组https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md
1996https://leetcode-cn.com/problems/the-number-of-weak-characters-in-the-game
游戏中弱角色的数量https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md
1997https://leetcode-cn.com/problems/first-day-where-you-have-been-in-all-the-rooms
访问完所有房间的第一天https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md
1998https://leetcode-cn.com/problems/gcd-sort-of-an-array
数组的最大公因数排序https://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md
1999https://leetcode-cn.com/problems/smallest-greater-multiple-made-of-two-digits
Smallest Greater Multiple Made of Two Digitshttps://github.com/CPythoner/leetcode-1/blob/main/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md
2000https://leetcode-cn.com/problems/reverse-prefix-of-word
反转单词前缀https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md
2001https://leetcode-cn.com/problems/number-of-pairs-of-interchangeable-rectangles
可互换矩形的组数https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md
2002https://leetcode-cn.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences
两个回文子序列长度的最大乘积https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md
2003https://leetcode-cn.com/problems/smallest-missing-genetic-value-in-each-subtree
每棵子树内缺失的最小基因值https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md
2004https://leetcode-cn.com/problems/the-number-of-seniors-and-juniors-to-join-the-company
The Number of Seniors and Juniors to Join the Companyhttps://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md
2005https://leetcode-cn.com/problems/subtree-removal-game-with-fibonacci-tree
Subtree Removal Game with Fibonacci Treehttps://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md
2006https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k
差的绝对值为 K 的数对数目https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md
2007https://leetcode-cn.com/problems/find-original-array-from-doubled-array
从双倍数组中还原原数组https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md
2008https://leetcode-cn.com/problems/maximum-earnings-from-taxi
出租车的最大盈利https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md
2009https://leetcode-cn.com/problems/minimum-number-of-operations-to-make-array-continuous
使数组连续的最少操作数https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md
2010https://leetcode-cn.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii
The Number of Seniors and Juniors to Join the Company IIhttps://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md
2011https://leetcode-cn.com/problems/final-value-of-variable-after-performing-operations
执行操作后的变量值https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md
2012https://leetcode-cn.com/problems/sum-of-beauty-in-the-array
数组美丽值求和https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md
2013https://leetcode-cn.com/problems/detect-squares
检测正方形https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2013.Detect%20Squares/README.md
2014https://leetcode-cn.com/problems/longest-subsequence-repeated-k-times
重复 K 次的最长子序列https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md
2015https://leetcode-cn.com/problems/average-height-of-buildings-in-each-segment
Average Height of Buildings in Each Segmenthttps://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md
2016https://leetcode-cn.com/problems/maximum-difference-between-increasing-elements
增量元素之间的最大差值https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md
2017https://leetcode-cn.com/problems/grid-game
网格游戏https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2017.Grid%20Game/README.md
2018https://leetcode-cn.com/problems/check-if-word-can-be-placed-in-crossword
判断单词是否能放入填字游戏内https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md
2019https://leetcode-cn.com/problems/the-score-of-students-solving-math-expression
解出数学表达式的学生分数https://github.com/CPythoner/leetcode-1/blob/main/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md
https://github.com/CPythoner/leetcode-1/tree/main/solution#版权
GitHub 开源社区 Doocshttps://github.com/doocs
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.