René's URL Explorer Experiment

Title: leetcode/solution at master · nodeadbird/leetcode · GitHub

Open Graph Title: leetcode/solution at master · nodeadbird/leetcode

X Title: leetcode/solution at master · nodeadbird/leetcode

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

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

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

Opengraph URL: https://github.com/nodeadbird/leetcode/tree/master/solution

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository/tree/name(/path)
route-controller	files
route-action	disambiguate
fetch-nonce	v2:502b68ca-4fff-d0ca-016e-1e29840fcfb6
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	8360:6650E:2BD4D8:3DD5B5:6A59D8FD
html-safe-nonce	f12cb1134d75da0c5c3dace09d8ac2e997dd308d9c772355468d4b9b1cc84a37
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4MzYwOjY2NTBFOjJCRDREODozREQ1QjU6NkE1OUQ4RkQiLCJ2aXNpdG9yX2lkIjoiMTk5NjkwNTE4NDQ2Nzk5ODk3MyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac	3ede654ab52274ddc7a6bbc5467a1ab4927b3eceabb57d208c54dd1493375760
hovercard-subject-tag	repository:314779287
github-keyboard-shortcuts	repository,source-code,file-tree,copilot
google-site-verification	Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-url	https://collector.github.com/github/collect
analytics-location	///files/disambiguate
fb:app_id	1401488693436528
apple-itunes-app	app-id=1477376905, app-argument=https://github.com/nodeadbird/leetcode/tree/master/solution
twitter:image	https://opengraph.githubassets.com/0195dd5472896f58bc223139b68ae79832a878003125b2eac2c55e6456fdbd26/nodeadbird/leetcode
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/0195dd5472896f58bc223139b68ae79832a878003125b2eac2c55e6456fdbd26/nodeadbird/leetcode
og:image:alt	😏 LeetCode solutions in any programming language \| 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - nodeadbird/leetcode
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	ba3976babb66479b1c943a8edc0777d96157da48fadc0161f9ddb219deee8353
turbo-cache-control	no-cache
go-import	github.com/nodeadbird/leetcode git https://github.com/nodeadbird/leetcode.git
octolytics-dimension-user_id	11224676
octolytics-dimension-user_login	nodeadbird
octolytics-dimension-repository_id	314779287
octolytics-dimension-repository_nwo	nodeadbird/leetcode
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	149001365
octolytics-dimension-repository_parent_nwo	doocs/leetcode
octolytics-dimension-repository_network_root_id	149001365
octolytics-dimension-repository_network_root_nwo	doocs/leetcode
turbo-body-classes	logged-out env-production page-responsive
disable-turbo	false
browser-stats-url	https://api.github.com/_private/browser/stats
browser-errors-url	https://api.github.com/_private/browser/errors
release	bfacf98c3b7ad151665d6ddd216469389872b251
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/nodeadbird/leetcode/tree/master/solution#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fnodeadbird%2Fleetcode%2Ftree%2Fmaster%2Fsolution
GitHub CopilotWrite better code with AI	https://github.com/features/copilot
GitHub Copilot appDirect agents from issue to merge	https://github.com/features/ai/github-app
MCP RegistryNewIntegrate external tools	https://github.com/mcp
ActionsAutomate any workflow	https://github.com/features/actions
CodespacesInstant dev environments	https://github.com/features/codespaces
IssuesPlan and track work	https://github.com/features/issues
Code ReviewManage code changes	https://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilities	https://github.com/security/advanced-security
Code securitySecure your code as you build	https://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they start	https://github.com/security/advanced-security/secret-protection
Why GitHub	https://github.com/why-github
Documentation	https://docs.github.com
Blog	https://github.blog
Changelog	https://github.blog/changelog
Marketplace	https://github.com/marketplace
View all features	https://github.com/features
Enterprises	https://github.com/enterprise
Small and medium teams	https://github.com/team
Startups	https://github.com/enterprise/startups
Nonprofits	https://github.com/solutions/industry/nonprofits
App Modernization	https://github.com/solutions/use-case/app-modernization
DevSecOps	https://github.com/solutions/use-case/devsecops
DevOps	https://github.com/solutions/use-case/devops
CI/CD	https://github.com/solutions/use-case/ci-cd
View all use cases	https://github.com/solutions/use-case
Healthcare	https://github.com/solutions/industry/healthcare
Financial services	https://github.com/solutions/industry/financial-services
Manufacturing	https://github.com/solutions/industry/manufacturing
Government	https://github.com/solutions/industry/government
View all industries	https://github.com/solutions/industry
View all solutions	https://github.com/solutions
AI	https://github.com/resources/articles?topic=ai
Software Development	https://github.com/resources/articles?topic=software-development
DevOps	https://github.com/resources/articles?topic=devops
Security	https://github.com/resources/articles?topic=security
View all topics	https://github.com/resources/articles
Customer stories	https://github.com/customer-stories
Events & webinars	https://github.com/resources/events
Ebooks & reports	https://github.com/resources/whitepapers
Business insights	https://github.com/solutions/executive-insights
GitHub Skills	https://skills.github.com
Documentation	https://docs.github.com
Customer support	https://support.github.com
Community forum	https://github.com/orgs/community/discussions
Trust center	https://github.com/trust-center
Partners	https://github.com/partners
View all resources	https://github.com/resources
GitHub SponsorsFund open source developers	https://github.com/open-source/sponsors
Security Lab	https://securitylab.github.com
Maintainer Community	https://maintainers.github.com
Accelerator	https://github.com/open-source/accelerator
GitHub Stars	https://stars.github.com
Archive Program	https://archiveprogram.github.com
Topics	https://github.com/topics
Trending	https://github.com/trending
Collections	https://github.com/collections
Enterprise platformAI-powered developer platform	https://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security features	https://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI features	https://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 support	https://github.com/enterprise/premium-support
Pricing	https://github.com/pricing
Search syntax tips	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentation	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fnodeadbird%2Fleetcode%2Ftree%2Fmaster%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=nodeadbird%2Fleetcode
Reload	https://github.com/nodeadbird/leetcode/tree/master/solution
Reload	https://github.com/nodeadbird/leetcode/tree/master/solution
Reload	https://github.com/nodeadbird/leetcode/tree/master/solution
nodeadbird	https://github.com/nodeadbird
leetcode	https://github.com/nodeadbird/leetcode
doocs/leetcode	https://github.com/doocs/leetcode
Notifications	https://github.com/login?return_to=%2Fnodeadbird%2Fleetcode
Fork 0	https://github.com/login?return_to=%2Fnodeadbird%2Fleetcode
Star 0	https://github.com/login?return_to=%2Fnodeadbird%2Fleetcode
Code	https://github.com/nodeadbird/leetcode
Pull requests 0	https://github.com/nodeadbird/leetcode/pulls
Actions	https://github.com/nodeadbird/leetcode/actions
Projects	https://github.com/nodeadbird/leetcode/projects
Security and quality 0	https://github.com/nodeadbird/leetcode/security
Insights	https://github.com/nodeadbird/leetcode/pulse
Code	https://github.com/nodeadbird/leetcode
Pull requests	https://github.com/nodeadbird/leetcode/pulls
Actions	https://github.com/nodeadbird/leetcode/actions
Projects	https://github.com/nodeadbird/leetcode/projects
Security and quality	https://github.com/nodeadbird/leetcode/security
Insights	https://github.com/nodeadbird/leetcode/pulse
	https://github.com/nodeadbird/leetcode
leetcode	https://github.com/nodeadbird/leetcode/tree/master
History	https://github.com/nodeadbird/leetcode/commits/master/solution
	https://github.com/nodeadbird/leetcode/commits/master/solution
leetcode	https://github.com/nodeadbird/leetcode/tree/master
..	https://github.com/nodeadbird/leetcode/tree/master
0000-0099	https://github.com/nodeadbird/leetcode/tree/master/solution/0000-0099
0000-0099	https://github.com/nodeadbird/leetcode/tree/master/solution/0000-0099
0100-0199	https://github.com/nodeadbird/leetcode/tree/master/solution/0100-0199
0100-0199	https://github.com/nodeadbird/leetcode/tree/master/solution/0100-0199
0200-0299	https://github.com/nodeadbird/leetcode/tree/master/solution/0200-0299
0200-0299	https://github.com/nodeadbird/leetcode/tree/master/solution/0200-0299
0300-0399	https://github.com/nodeadbird/leetcode/tree/master/solution/0300-0399
0300-0399	https://github.com/nodeadbird/leetcode/tree/master/solution/0300-0399
0400-0499	https://github.com/nodeadbird/leetcode/tree/master/solution/0400-0499
0400-0499	https://github.com/nodeadbird/leetcode/tree/master/solution/0400-0499
0500-0599	https://github.com/nodeadbird/leetcode/tree/master/solution/0500-0599
0500-0599	https://github.com/nodeadbird/leetcode/tree/master/solution/0500-0599
0600-0699	https://github.com/nodeadbird/leetcode/tree/master/solution/0600-0699
0600-0699	https://github.com/nodeadbird/leetcode/tree/master/solution/0600-0699
0700-0799	https://github.com/nodeadbird/leetcode/tree/master/solution/0700-0799
0700-0799	https://github.com/nodeadbird/leetcode/tree/master/solution/0700-0799
0800-0899	https://github.com/nodeadbird/leetcode/tree/master/solution/0800-0899
0800-0899	https://github.com/nodeadbird/leetcode/tree/master/solution/0800-0899
0900-0999	https://github.com/nodeadbird/leetcode/tree/master/solution/0900-0999
0900-0999	https://github.com/nodeadbird/leetcode/tree/master/solution/0900-0999
1000-1099	https://github.com/nodeadbird/leetcode/tree/master/solution/1000-1099
1000-1099	https://github.com/nodeadbird/leetcode/tree/master/solution/1000-1099
1100-1199	https://github.com/nodeadbird/leetcode/tree/master/solution/1100-1199
1100-1199	https://github.com/nodeadbird/leetcode/tree/master/solution/1100-1199
1200-1299	https://github.com/nodeadbird/leetcode/tree/master/solution/1200-1299
1200-1299	https://github.com/nodeadbird/leetcode/tree/master/solution/1200-1299
1300-1399	https://github.com/nodeadbird/leetcode/tree/master/solution/1300-1399
1300-1399	https://github.com/nodeadbird/leetcode/tree/master/solution/1300-1399
1400-1499	https://github.com/nodeadbird/leetcode/tree/master/solution/1400-1499
1400-1499	https://github.com/nodeadbird/leetcode/tree/master/solution/1400-1499
1500-1599	https://github.com/nodeadbird/leetcode/tree/master/solution/1500-1599
1500-1599	https://github.com/nodeadbird/leetcode/tree/master/solution/1500-1599
5000-5099	https://github.com/nodeadbird/leetcode/tree/master/solution/5000-5099
5000-5099	https://github.com/nodeadbird/leetcode/tree/master/solution/5000-5099
README.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README.md
README.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README.md
README_EN.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README_EN.md
README_EN.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README_EN.md
README_TEMPLATE.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README_TEMPLATE.md
README_TEMPLATE.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README_TEMPLATE.md
README_TEMPLATE_EN.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README_TEMPLATE_EN.md
README_TEMPLATE_EN.md	https://github.com/nodeadbird/leetcode/blob/master/solution/README_TEMPLATE_EN.md
__init__.py	https://github.com/nodeadbird/leetcode/blob/master/solution/__init__.py
__init__.py	https://github.com/nodeadbird/leetcode/blob/master/solution/__init__.py
main.py	https://github.com/nodeadbird/leetcode/blob/master/solution/main.py
main.py	https://github.com/nodeadbird/leetcode/blob/master/solution/main.py
result.json	https://github.com/nodeadbird/leetcode/blob/master/solution/result.json
result.json	https://github.com/nodeadbird/leetcode/blob/master/solution/result.json
summary.md	https://github.com/nodeadbird/leetcode/blob/master/solution/summary.md
summary.md	https://github.com/nodeadbird/leetcode/blob/master/solution/summary.md
summary.py	https://github.com/nodeadbird/leetcode/blob/master/solution/summary.py
summary.py	https://github.com/nodeadbird/leetcode/blob/master/solution/summary.py
summary_en.md	https://github.com/nodeadbird/leetcode/blob/master/solution/summary_en.md
summary_en.md	https://github.com/nodeadbird/leetcode/blob/master/solution/summary_en.md
README.md	https://github.com/nodeadbird/leetcode/tree/master/solution#readme
	https://github.com/nodeadbird/leetcode/tree/master/solution#leetcode
English Version	https://github.com/nodeadbird/leetcode/blob/master/solution/README_EN.md
	https://github.com/nodeadbird/leetcode/tree/master/solution#题解
LeetCode 中国官网	https://leetcode-cn.com/problemset/all
doocs/leetcode 贡献者	https://github.com/doocs/leetcode/graphs/contributors
0001	https://leetcode-cn.com/problems/two-sum
两数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0001.Two%20Sum/README.md
0002	https://leetcode-cn.com/problems/add-two-numbers
两数相加	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0002.Add%20Two%20Numbers/README.md
0003	https://leetcode-cn.com/problems/longest-substring-without-repeating-characters
无重复字符的最长子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md
0004	https://leetcode-cn.com/problems/median-of-two-sorted-arrays
寻找两个正序数组的中位数	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md
0005	https://leetcode-cn.com/problems/longest-palindromic-substring
最长回文子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md
0006	https://leetcode-cn.com/problems/zigzag-conversion
Z 字形变换	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0006.ZigZag%20Conversion/README.md
0007	https://leetcode-cn.com/problems/reverse-integer
整数反转	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0007.Reverse%20Integer/README.md
0008	https://leetcode-cn.com/problems/string-to-integer-atoi
字符串转换整数 (atoi)	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md
0009	https://leetcode-cn.com/problems/palindrome-number
回文数	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0009.Palindrome%20Number/README.md
0010	https://leetcode-cn.com/problems/regular-expression-matching
正则表达式匹配	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md
0011	https://leetcode-cn.com/problems/container-with-most-water
盛最多水的容器	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md
0012	https://leetcode-cn.com/problems/integer-to-roman
整数转罗马数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0012.Integer%20to%20Roman/README.md
0013	https://leetcode-cn.com/problems/roman-to-integer
罗马数字转整数	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0013.Roman%20to%20Integer/README.md
0014	https://leetcode-cn.com/problems/longest-common-prefix
最长公共前缀	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md
0015	https://leetcode-cn.com/problems/3sum
三数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0015.3Sum/README.md
0016	https://leetcode-cn.com/problems/3sum-closest
最接近的三数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0016.3Sum%20Closest/README.md
0017	https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number
电话号码的字母组合	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md
0018	https://leetcode-cn.com/problems/4sum
四数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0018.4Sum/README.md
0019	https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list
删除链表的倒数第 N 个节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md
0020	https://leetcode-cn.com/problems/valid-parentheses
有效的括号	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0020.Valid%20Parentheses/README.md
0021	https://leetcode-cn.com/problems/merge-two-sorted-lists
合并两个有序链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md
0022	https://leetcode-cn.com/problems/generate-parentheses
括号生成	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0022.Generate%20Parentheses/README.md
0023	https://leetcode-cn.com/problems/merge-k-sorted-lists
合并 K 个升序链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md
0024	https://leetcode-cn.com/problems/swap-nodes-in-pairs
两两交换链表中的节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md
0025	https://leetcode-cn.com/problems/reverse-nodes-in-k-group
K 个一组翻转链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md
0026	https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array
删除排序数组中的重复项	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md
0027	https://leetcode-cn.com/problems/remove-element
移除元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0027.Remove%20Element/README.md
0028	https://leetcode-cn.com/problems/implement-strstr
实现 strStr()	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0028.Implement%20strStr%28%29/README.md
0029	https://leetcode-cn.com/problems/divide-two-integers
两数相除	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0029.Divide%20Two%20Integers/README.md
0030	https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words
串联所有单词的子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md
0031	https://leetcode-cn.com/problems/next-permutation
下一个排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0031.Next%20Permutation/README.md
0032	https://leetcode-cn.com/problems/longest-valid-parentheses
最长有效括号	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md
0033	https://leetcode-cn.com/problems/search-in-rotated-sorted-array
搜索旋转排序数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md
0034	https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array
在排序数组中查找元素的第一个和最后一个位置	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md
0035	https://leetcode-cn.com/problems/search-insert-position
搜索插入位置	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0035.Search%20Insert%20Position/README.md
0036	https://leetcode-cn.com/problems/valid-sudoku
有效的数独	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0036.Valid%20Sudoku/README.md
0037	https://leetcode-cn.com/problems/sudoku-solver
解数独	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0037.Sudoku%20Solver/README.md
0038	https://leetcode-cn.com/problems/count-and-say
外观数列	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0038.Count%20and%20Say/README.md
0039	https://leetcode-cn.com/problems/combination-sum
组合总和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0039.Combination%20Sum/README.md
0040	https://leetcode-cn.com/problems/combination-sum-ii
组合总和 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0040.Combination%20Sum%20II/README.md
0041	https://leetcode-cn.com/problems/first-missing-positive
缺失的第一个正数	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0041.First%20Missing%20Positive/README.md
0042	https://leetcode-cn.com/problems/trapping-rain-water
接雨水	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md
0043	https://leetcode-cn.com/problems/multiply-strings
字符串相乘	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0043.Multiply%20Strings/README.md
0044	https://leetcode-cn.com/problems/wildcard-matching
通配符匹配	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0044.Wildcard%20Matching/README.md
0045	https://leetcode-cn.com/problems/jump-game-ii
跳跃游戏 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0045.Jump%20Game%20II/README.md
0046	https://leetcode-cn.com/problems/permutations
全排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0046.Permutations/README.md
0047	https://leetcode-cn.com/problems/permutations-ii
全排列 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0047.Permutations%20II/README.md
0048	https://leetcode-cn.com/problems/rotate-image
旋转图像	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0048.Rotate%20Image/README.md
0049	https://leetcode-cn.com/problems/group-anagrams
字母异位词分组	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0049.Group%20Anagrams/README.md
0050	https://leetcode-cn.com/problems/powx-n
Pow(x, n)	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md
0051	https://leetcode-cn.com/problems/n-queens
N 皇后	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0051.N-Queens/README.md
0052	https://leetcode-cn.com/problems/n-queens-ii
N 皇后 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0052.N-Queens%20II/README.md
0053	https://leetcode-cn.com/problems/maximum-subarray
最大子序和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0053.Maximum%20Subarray/README.md
0054	https://leetcode-cn.com/problems/spiral-matrix
螺旋矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0054.Spiral%20Matrix/README.md
0055	https://leetcode-cn.com/problems/jump-game
跳跃游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0055.Jump%20Game/README.md
0056	https://leetcode-cn.com/problems/merge-intervals
合并区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0056.Merge%20Intervals/README.md
0057	https://leetcode-cn.com/problems/insert-interval
插入区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0057.Insert%20Interval/README.md
0058	https://leetcode-cn.com/problems/length-of-last-word
最后一个单词的长度	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md
0059	https://leetcode-cn.com/problems/spiral-matrix-ii
螺旋矩阵 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md
0060	https://leetcode-cn.com/problems/permutation-sequence
第 k 个排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0060.Permutation%20Sequence/README.md
0061	https://leetcode-cn.com/problems/rotate-list
旋转链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0061.Rotate%20List/README.md
0062	https://leetcode-cn.com/problems/unique-paths
不同路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0062.Unique%20Paths/README.md
0063	https://leetcode-cn.com/problems/unique-paths-ii
不同路径 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0063.Unique%20Paths%20II/README.md
0064	https://leetcode-cn.com/problems/minimum-path-sum
最小路径和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md
0065	https://leetcode-cn.com/problems/valid-number
有效数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0065.Valid%20Number/README.md
0066	https://leetcode-cn.com/problems/plus-one
加一	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0066.Plus%20One/README.md
0067	https://leetcode-cn.com/problems/add-binary
二进制求和	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0067.Add%20Binary/README.md
0068	https://leetcode-cn.com/problems/text-justification
文本左右对齐	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0068.Text%20Justification/README.md
0069	https://leetcode-cn.com/problems/sqrtx
x 的平方根	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0069.Sqrt%28x%29/README.md
0070	https://leetcode-cn.com/problems/climbing-stairs
爬楼梯	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0070.Climbing%20Stairs/README.md
0071	https://leetcode-cn.com/problems/simplify-path
简化路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0071.Simplify%20Path/README.md
0072	https://leetcode-cn.com/problems/edit-distance
编辑距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0072.Edit%20Distance/README.md
0073	https://leetcode-cn.com/problems/set-matrix-zeroes
矩阵置零	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md
0074	https://leetcode-cn.com/problems/search-a-2d-matrix
搜索二维矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md
0075	https://leetcode-cn.com/problems/sort-colors
颜色分类	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0075.Sort%20Colors/README.md
0076	https://leetcode-cn.com/problems/minimum-window-substring
最小覆盖子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md
0077	https://leetcode-cn.com/problems/combinations
组合	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0077.Combinations/README.md
0078	https://leetcode-cn.com/problems/subsets
子集	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0078.Subsets/README.md
0079	https://leetcode-cn.com/problems/word-search
单词搜索	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0079.Word%20Search/README.md
0080	https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii
删除排序数组中的重复项 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md
0081	https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii
搜索旋转排序数组 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md
0082	https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii
删除排序链表中的重复元素 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md
0083	https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list
删除排序链表中的重复元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md
0084	https://leetcode-cn.com/problems/largest-rectangle-in-histogram
柱状图中最大的矩形	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md
0085	https://leetcode-cn.com/problems/maximal-rectangle
最大矩形	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0085.Maximal%20Rectangle/README.md
0086	https://leetcode-cn.com/problems/partition-list
分隔链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0086.Partition%20List/README.md
0087	https://leetcode-cn.com/problems/scramble-string
扰乱字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0087.Scramble%20String/README.md
0088	https://leetcode-cn.com/problems/merge-sorted-array
合并两个有序数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md
0089	https://leetcode-cn.com/problems/gray-code
格雷编码	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0089.Gray%20Code/README.md
0090	https://leetcode-cn.com/problems/subsets-ii
子集 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0090.Subsets%20II/README.md
0091	https://leetcode-cn.com/problems/decode-ways
解码方法	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0091.Decode%20Ways/README.md
0092	https://leetcode-cn.com/problems/reverse-linked-list-ii
反转链表 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md
0093	https://leetcode-cn.com/problems/restore-ip-addresses
复原 IP 地址	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md
0094	https://leetcode-cn.com/problems/binary-tree-inorder-traversal
二叉树的中序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md
0095	https://leetcode-cn.com/problems/unique-binary-search-trees-ii
不同的二叉搜索树 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md
0096	https://leetcode-cn.com/problems/unique-binary-search-trees
不同的二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md
0097	https://leetcode-cn.com/problems/interleaving-string
交错字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0097.Interleaving%20String/README.md
0098	https://leetcode-cn.com/problems/validate-binary-search-tree
验证二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md
0099	https://leetcode-cn.com/problems/recover-binary-search-tree
恢复二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md
0100	https://leetcode-cn.com/problems/same-tree
相同的树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0100.Same%20Tree/README.md
0101	https://leetcode-cn.com/problems/symmetric-tree
对称二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0101.Symmetric%20Tree/README.md
0102	https://leetcode-cn.com/problems/binary-tree-level-order-traversal
二叉树的层序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md
0103	https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal
二叉树的锯齿形层次遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md
0104	https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
二叉树的最大深度	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md
0105	https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
从前序与中序遍历序列构造二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md
0106	https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
从中序与后序遍历序列构造二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md
0107	https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii
二叉树的层次遍历 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md
0108	https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree
将有序数组转换为二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md
0109	https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree
有序链表转换二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md
0110	https://leetcode-cn.com/problems/balanced-binary-tree
平衡二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md
0111	https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
二叉树的最小深度	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md
0112	https://leetcode-cn.com/problems/path-sum
路径总和	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0112.Path%20Sum/README.md
0113	https://leetcode-cn.com/problems/path-sum-ii
路径总和 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0113.Path%20Sum%20II/README.md
0114	https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list
二叉树展开为链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md
0115	https://leetcode-cn.com/problems/distinct-subsequences
不同的子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0115.Distinct%20Subsequences/README.md
0116	https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node
填充每个节点的下一个右侧节点指针	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md
0117	https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii
填充每个节点的下一个右侧节点指针 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md
0118	https://leetcode-cn.com/problems/pascals-triangle
杨辉三角	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md
0119	https://leetcode-cn.com/problems/pascals-triangle-ii
杨辉三角 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md
0120	https://leetcode-cn.com/problems/triangle
三角形最小路径和	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0120.Triangle/README.md
0121	https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock
买卖股票的最佳时机	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md
0122	https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii
买卖股票的最佳时机 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md
0123	https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii
买卖股票的最佳时机 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md
0124	https://leetcode-cn.com/problems/binary-tree-maximum-path-sum
二叉树中的最大路径和	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md
0125	https://leetcode-cn.com/problems/valid-palindrome
验证回文串	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0125.Valid%20Palindrome/README.md
0126	https://leetcode-cn.com/problems/word-ladder-ii
单词接龙 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0126.Word%20Ladder%20II/README.md
0127	https://leetcode-cn.com/problems/word-ladder
单词接龙	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0127.Word%20Ladder/README.md
0128	https://leetcode-cn.com/problems/longest-consecutive-sequence
最长连续序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md
0129	https://leetcode-cn.com/problems/sum-root-to-leaf-numbers
求根到叶子节点数字之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md
0130	https://leetcode-cn.com/problems/surrounded-regions
被围绕的区域	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0130.Surrounded%20Regions/README.md
0131	https://leetcode-cn.com/problems/palindrome-partitioning
分割回文串	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0131.Palindrome%20Partitioning/README.md
0132	https://leetcode-cn.com/problems/palindrome-partitioning-ii
分割回文串 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md
0133	https://leetcode-cn.com/problems/clone-graph
克隆图	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0133.Clone%20Graph/README.md
0134	https://leetcode-cn.com/problems/gas-station
加油站	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0134.Gas%20Station/README.md
0135	https://leetcode-cn.com/problems/candy
分发糖果	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0135.Candy/README.md
0136	https://leetcode-cn.com/problems/single-number
只出现一次的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0136.Single%20Number/README.md
0137	https://leetcode-cn.com/problems/single-number-ii
只出现一次的数字 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0137.Single%20Number%20II/README.md
0138	https://leetcode-cn.com/problems/copy-list-with-random-pointer
复制带随机指针的链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md
0139	https://leetcode-cn.com/problems/word-break
单词拆分	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0139.Word%20Break/README.md
0140	https://leetcode-cn.com/problems/word-break-ii
单词拆分 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0140.Word%20Break%20II/README.md
0141	https://leetcode-cn.com/problems/linked-list-cycle
环形链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0141.Linked%20List%20Cycle/README.md
0142	https://leetcode-cn.com/problems/linked-list-cycle-ii
环形链表 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md
0143	https://leetcode-cn.com/problems/reorder-list
重排链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0143.Reorder%20List/README.md
0144	https://leetcode-cn.com/problems/binary-tree-preorder-traversal
二叉树的前序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md
0145	https://leetcode-cn.com/problems/binary-tree-postorder-traversal
二叉树的后序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md
0146	https://leetcode-cn.com/problems/lru-cache
LRU 缓存机制	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0146.LRU%20Cache/README.md
0147	https://leetcode-cn.com/problems/insertion-sort-list
对链表进行插入排序	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0147.Insertion%20Sort%20List/README.md
0148	https://leetcode-cn.com/problems/sort-list
排序链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0148.Sort%20List/README.md
0149	https://leetcode-cn.com/problems/max-points-on-a-line
直线上最多的点数	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md
0150	https://leetcode-cn.com/problems/evaluate-reverse-polish-notation
逆波兰表达式求值	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md
0151	https://leetcode-cn.com/problems/reverse-words-in-a-string
翻转字符串里的单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md
0152	https://leetcode-cn.com/problems/maximum-product-subarray
乘积最大子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md
0153	https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array
寻找旋转排序数组中的最小值	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md
0154	https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii
寻找旋转排序数组中的最小值 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md
0155	https://leetcode-cn.com/problems/min-stack
最小栈	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0155.Min%20Stack/README.md
0156	https://leetcode-cn.com/problems/binary-tree-upside-down
上下翻转二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md
0157	https://leetcode-cn.com/problems/read-n-characters-given-read4
用 Read4 读取 N 个字符	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md
0158	https://leetcode-cn.com/problems/read-n-characters-given-read4-ii-call-multiple-times
用 Read4 读取 N 个字符 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README.md
0159	https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters
至多包含两个不同字符的最长子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md
0160	https://leetcode-cn.com/problems/intersection-of-two-linked-lists
相交链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md
0161	https://leetcode-cn.com/problems/one-edit-distance
相隔为 1 的编辑距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0161.One%20Edit%20Distance/README.md
0162	https://leetcode-cn.com/problems/find-peak-element
寻找峰值	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0162.Find%20Peak%20Element/README.md
0163	https://leetcode-cn.com/problems/missing-ranges
缺失的区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0163.Missing%20Ranges/README.md
0164	https://leetcode-cn.com/problems/maximum-gap
最大间距	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0164.Maximum%20Gap/README.md
0165	https://leetcode-cn.com/problems/compare-version-numbers
比较版本号	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md
0166	https://leetcode-cn.com/problems/fraction-to-recurring-decimal
分数到小数	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md
0167	https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted
两数之和 II - 输入有序数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20array%20is%20sorted/README.md
0168	https://leetcode-cn.com/problems/excel-sheet-column-title
Excel 表列名称	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md
0169	https://leetcode-cn.com/problems/majority-element
多数元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0169.Majority%20Element/README.md
0170	https://leetcode-cn.com/problems/two-sum-iii-data-structure-design
两数之和 III - 数据结构设计	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md
0171	https://leetcode-cn.com/problems/excel-sheet-column-number
Excel 表列序号	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md
0172	https://leetcode-cn.com/problems/factorial-trailing-zeroes
阶乘后的零	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md
0173	https://leetcode-cn.com/problems/binary-search-tree-iterator
二叉搜索树迭代器	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md
0174	https://leetcode-cn.com/problems/dungeon-game
地下城游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0174.Dungeon%20Game/README.md
0175	https://leetcode-cn.com/problems/combine-two-tables
组合两个表	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0175.Combine%20Two%20Tables/README.md
0176	https://leetcode-cn.com/problems/second-highest-salary
第二高的薪水	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0176.Second%20Highest%20Salary/README.md
0177	https://leetcode-cn.com/problems/nth-highest-salary
第 N 高的薪水	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md
0178	https://leetcode-cn.com/problems/rank-scores
分数排名	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0178.Rank%20Scores/README.md
0179	https://leetcode-cn.com/problems/largest-number
最大数	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0179.Largest%20Number/README.md
0180	https://leetcode-cn.com/problems/consecutive-numbers
连续出现的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0180.Consecutive%20Numbers/README.md
0181	https://leetcode-cn.com/problems/employees-earning-more-than-their-managers
超过经理收入的员工	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md
0182	https://leetcode-cn.com/problems/duplicate-emails
查找重复的电子邮箱	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0182.Duplicate%20Emails/README.md
0183	https://leetcode-cn.com/problems/customers-who-never-order
从不订购的客户	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md
0184	https://leetcode-cn.com/problems/department-highest-salary
部门工资最高的员工	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0184.Department%20Highest%20Salary/README.md
0185	https://leetcode-cn.com/problems/department-top-three-salaries
部门工资前三高的所有员工	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md
0186	https://leetcode-cn.com/problems/reverse-words-in-a-string-ii
翻转字符串里的单词 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md
0187	https://leetcode-cn.com/problems/repeated-dna-sequences
重复的 DNA 序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md
0188	https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv
买卖股票的最佳时机 IV	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md
0189	https://leetcode-cn.com/problems/rotate-array
旋转数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0189.Rotate%20Array/README.md
0190	https://leetcode-cn.com/problems/reverse-bits
颠倒二进制位	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0190.Reverse%20Bits/README.md
0191	https://leetcode-cn.com/problems/number-of-1-bits
位 1 的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0191.Number%20of%201%20Bits/README.md
0192	https://leetcode-cn.com/problems/word-frequency
统计词频	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0192.Word%20Frequency/README.md
0193	https://leetcode-cn.com/problems/valid-phone-numbers
有效电话号码	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md
0194	https://leetcode-cn.com/problems/transpose-file
转置文件	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0194.Transpose%20File/README.md
0195	https://leetcode-cn.com/problems/tenth-line
第十行	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0195.Tenth%20Line/README.md
0196	https://leetcode-cn.com/problems/delete-duplicate-emails
删除重复的电子邮箱	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md
0197	https://leetcode-cn.com/problems/rising-temperature
上升的温度	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0197.Rising%20Temperature/README.md
0198	https://leetcode-cn.com/problems/house-robber
打家劫舍	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0198.House%20Robber/README.md
0199	https://leetcode-cn.com/problems/binary-tree-right-side-view
二叉树的右视图	https://github.com/nodeadbird/leetcode/blob/master/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md
0200	https://leetcode-cn.com/problems/number-of-islands
岛屿数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0200.Number%20of%20Islands/README.md
0201	https://leetcode-cn.com/problems/bitwise-and-of-numbers-range
数字范围按位与	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md
0202	https://leetcode-cn.com/problems/happy-number
快乐数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0202.Happy%20Number/README.md
0203	https://leetcode-cn.com/problems/remove-linked-list-elements
移除链表元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md
0204	https://leetcode-cn.com/problems/count-primes
计数质数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0204.Count%20Primes/README.md
0205	https://leetcode-cn.com/problems/isomorphic-strings
同构字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0205.Isomorphic%20Strings/README.md
0206	https://leetcode-cn.com/problems/reverse-linked-list
反转链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0206.Reverse%20Linked%20List/README.md
0207	https://leetcode-cn.com/problems/course-schedule
课程表	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0207.Course%20Schedule/README.md
0208	https://leetcode-cn.com/problems/implement-trie-prefix-tree
实现 Trie (前缀树)	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md
0209	https://leetcode-cn.com/problems/minimum-size-subarray-sum
长度最小的子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md
0210	https://leetcode-cn.com/problems/course-schedule-ii
课程表 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0210.Course%20Schedule%20II/README.md
0211	https://leetcode-cn.com/problems/design-add-and-search-words-data-structure
添加与搜索单词 - 数据结构设计	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md
0212	https://leetcode-cn.com/problems/word-search-ii
单词搜索 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0212.Word%20Search%20II/README.md
0213	https://leetcode-cn.com/problems/house-robber-ii
打家劫舍 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0213.House%20Robber%20II/README.md
0214	https://leetcode-cn.com/problems/shortest-palindrome
最短回文串	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0214.Shortest%20Palindrome/README.md
0215	https://leetcode-cn.com/problems/kth-largest-element-in-an-array
数组中的第 K 个最大元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md
0216	https://leetcode-cn.com/problems/combination-sum-iii
组合总和 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0216.Combination%20Sum%20III/README.md
0217	https://leetcode-cn.com/problems/contains-duplicate
存在重复元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0217.Contains%20Duplicate/README.md
0218	https://leetcode-cn.com/problems/the-skyline-problem
天际线问题	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0218.The%20Skyline%20Problem/README.md
0219	https://leetcode-cn.com/problems/contains-duplicate-ii
存在重复元素 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md
0220	https://leetcode-cn.com/problems/contains-duplicate-iii
存在重复元素 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md
0221	https://leetcode-cn.com/problems/maximal-square
最大正方形	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0221.Maximal%20Square/README.md
0222	https://leetcode-cn.com/problems/count-complete-tree-nodes
完全二叉树的节点个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md
0223	https://leetcode-cn.com/problems/rectangle-area
矩形面积	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0223.Rectangle%20Area/README.md
0224	https://leetcode-cn.com/problems/basic-calculator
基本计算器	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0224.Basic%20Calculator/README.md
0225	https://leetcode-cn.com/problems/implement-stack-using-queues
用队列实现栈	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md
0226	https://leetcode-cn.com/problems/invert-binary-tree
翻转二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md
0227	https://leetcode-cn.com/problems/basic-calculator-ii
基本计算器 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0227.Basic%20Calculator%20II/README.md
0228	https://leetcode-cn.com/problems/summary-ranges
汇总区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0228.Summary%20Ranges/README.md
0229	https://leetcode-cn.com/problems/majority-element-ii
求众数 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0229.Majority%20Element%20II/README.md
0230	https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst
二叉搜索树中第 K 小的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md
0231	https://leetcode-cn.com/problems/power-of-two
2 的幂	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0231.Power%20of%20Two/README.md
0232	https://leetcode-cn.com/problems/implement-queue-using-stacks
用栈实现队列	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md
0233	https://leetcode-cn.com/problems/number-of-digit-one
数字 1 的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md
0234	https://leetcode-cn.com/problems/palindrome-linked-list
回文链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md
0235	https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree
二叉搜索树的最近公共祖先	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md
0236	https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree
二叉树的最近公共祖先	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md
0237	https://leetcode-cn.com/problems/delete-node-in-a-linked-list
删除链表中的节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md
0238	https://leetcode-cn.com/problems/product-of-array-except-self
除自身以外数组的乘积	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md
0239	https://leetcode-cn.com/problems/sliding-window-maximum
滑动窗口最大值	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md
0240	https://leetcode-cn.com/problems/search-a-2d-matrix-ii
搜索二维矩阵 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md
0241	https://leetcode-cn.com/problems/different-ways-to-add-parentheses
为运算表达式设计优先级	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md
0242	https://leetcode-cn.com/problems/valid-anagram
有效的字母异位词	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0242.Valid%20Anagram/README.md
0243	https://leetcode-cn.com/problems/shortest-word-distance
最短单词距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md
0244	https://leetcode-cn.com/problems/shortest-word-distance-ii
最短单词距离 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md
0245	https://leetcode-cn.com/problems/shortest-word-distance-iii
最短单词距离 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md
0246	https://leetcode-cn.com/problems/strobogrammatic-number
中心对称数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0246.Strobogrammatic%20Number/README.md
0247	https://leetcode-cn.com/problems/strobogrammatic-number-ii
中心对称数 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md
0248	https://leetcode-cn.com/problems/strobogrammatic-number-iii
中心对称数 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md
0249	https://leetcode-cn.com/problems/group-shifted-strings
移位字符串分组	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md
0250	https://leetcode-cn.com/problems/count-univalue-subtrees
统计同值子树	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md
0251	https://leetcode-cn.com/problems/flatten-2d-vector
展开二维向量	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0251.Flatten%202D%20Vector/README.md
0252	https://leetcode-cn.com/problems/meeting-rooms
会议室	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0252.Meeting%20Rooms/README.md
0253	https://leetcode-cn.com/problems/meeting-rooms-ii
会议室 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md
0254	https://leetcode-cn.com/problems/factor-combinations
因子的组合	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0254.Factor%20Combinations/README.md
0255	https://leetcode-cn.com/problems/verify-preorder-sequence-in-binary-search-tree
验证前序遍历序列二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md
0256	https://leetcode-cn.com/problems/paint-house
粉刷房子	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0256.Paint%20House/README.md
0257	https://leetcode-cn.com/problems/binary-tree-paths
二叉树的所有路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md
0258	https://leetcode-cn.com/problems/add-digits
各位相加	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0258.Add%20Digits/README.md
0259	https://leetcode-cn.com/problems/3sum-smaller
较小的三数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0259.3Sum%20Smaller/README.md
0260	https://leetcode-cn.com/problems/single-number-iii
只出现一次的数字 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0260.Single%20Number%20III/README.md
0261	https://leetcode-cn.com/problems/graph-valid-tree
以图判树	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md
0262	https://leetcode-cn.com/problems/trips-and-users
行程和用户	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0262.Trips%20and%20Users/README.md
0263	https://leetcode-cn.com/problems/ugly-number
丑数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0263.Ugly%20Number/README.md
0264	https://leetcode-cn.com/problems/ugly-number-ii
丑数 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0264.Ugly%20Number%20II/README.md
0265	https://leetcode-cn.com/problems/paint-house-ii
粉刷房子 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0265.Paint%20House%20II/README.md
0266	https://leetcode-cn.com/problems/palindrome-permutation
回文排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0266.Palindrome%20Permutation/README.md
0267	https://leetcode-cn.com/problems/palindrome-permutation-ii
回文排列 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md
0268	https://leetcode-cn.com/problems/missing-number
缺失数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0268.Missing%20Number/README.md
0269	https://leetcode-cn.com/problems/alien-dictionary
火星词典	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0269.Alien%20Dictionary/README.md
0270	https://leetcode-cn.com/problems/closest-binary-search-tree-value
最接近的二叉搜索树值	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md
0271	https://leetcode-cn.com/problems/encode-and-decode-strings
字符串的编码与解码	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md
0272	https://leetcode-cn.com/problems/closest-binary-search-tree-value-ii
最接近的二叉搜索树值 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md
0273	https://leetcode-cn.com/problems/integer-to-english-words
整数转换英文表示	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md
0274	https://leetcode-cn.com/problems/h-index
H 指数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0274.H-Index/README.md
0275	https://leetcode-cn.com/problems/h-index-ii
H 指数 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0275.H-Index%20II/README.md
0276	https://leetcode-cn.com/problems/paint-fence
栅栏涂色	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0276.Paint%20Fence/README.md
0277	https://leetcode-cn.com/problems/find-the-celebrity
搜寻名人	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0277.Find%20the%20Celebrity/README.md
0278	https://leetcode-cn.com/problems/first-bad-version
第一个错误的版本	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0278.First%20Bad%20Version/README.md
0279	https://leetcode-cn.com/problems/perfect-squares
完全平方数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0279.Perfect%20Squares/README.md
0280	https://leetcode-cn.com/problems/wiggle-sort
摆动排序	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0280.Wiggle%20Sort/README.md
0281	https://leetcode-cn.com/problems/zigzag-iterator
锯齿迭代器	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0281.Zigzag%20Iterator/README.md
0282	https://leetcode-cn.com/problems/expression-add-operators
给表达式添加运算符	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0282.Expression%20Add%20Operators/README.md
0283	https://leetcode-cn.com/problems/move-zeroes
移动零	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0283.Move%20Zeroes/README.md
0284	https://leetcode-cn.com/problems/peeking-iterator
顶端迭代器	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0284.Peeking%20Iterator/README.md
0285	https://leetcode-cn.com/problems/inorder-successor-in-bst
二叉搜索树中的顺序后继	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md
0286	https://leetcode-cn.com/problems/walls-and-gates
墙与门	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0286.Walls%20and%20Gates/README.md
0287	https://leetcode-cn.com/problems/find-the-duplicate-number
寻找重复数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md
0288	https://leetcode-cn.com/problems/unique-word-abbreviation
单词的唯一缩写	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md
0289	https://leetcode-cn.com/problems/game-of-life
生命游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0289.Game%20of%20Life/README.md
0290	https://leetcode-cn.com/problems/word-pattern
单词规律	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0290.Word%20Pattern/README.md
0291	https://leetcode-cn.com/problems/word-pattern-ii
单词规律 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0291.Word%20Pattern%20II/README.md
0292	https://leetcode-cn.com/problems/nim-game
Nim 游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0292.Nim%20Game/README.md
0293	https://leetcode-cn.com/problems/flip-game
翻转游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0293.Flip%20Game/README.md
0294	https://leetcode-cn.com/problems/flip-game-ii
翻转游戏 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0294.Flip%20Game%20II/README.md
0295	https://leetcode-cn.com/problems/find-median-from-data-stream
数据流的中位数	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md
0296	https://leetcode-cn.com/problems/best-meeting-point
最佳的碰头地点	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0296.Best%20Meeting%20Point/README.md
0297	https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree
二叉树的序列化与反序列化	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md
0298	https://leetcode-cn.com/problems/binary-tree-longest-consecutive-sequence
二叉树最长连续序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md
0299	https://leetcode-cn.com/problems/bulls-and-cows
猜数字游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0200-0299/0299.Bulls%20and%20Cows/README.md
0300	https://leetcode-cn.com/problems/longest-increasing-subsequence
最长上升子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md
0301	https://leetcode-cn.com/problems/remove-invalid-parentheses
删除无效的括号	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md
0302	https://leetcode-cn.com/problems/smallest-rectangle-enclosing-black-pixels
包含全部黑色像素的最小矩形	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md
0303	https://leetcode-cn.com/problems/range-sum-query-immutable
区域和检索 - 数组不可变	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md
0304	https://leetcode-cn.com/problems/range-sum-query-2d-immutable
二维区域和检索 - 矩阵不可变	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md
0305	https://leetcode-cn.com/problems/number-of-islands-ii
岛屿数量 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md
0306	https://leetcode-cn.com/problems/additive-number
累加数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0306.Additive%20Number/README.md
0307	https://leetcode-cn.com/problems/range-sum-query-mutable
区域和检索 - 数组可修改	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md
0308	https://leetcode-cn.com/problems/range-sum-query-2d-mutable
二维区域和检索 - 可变	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md
0309	https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown
最佳买卖股票时机含冷冻期	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md
0310	https://leetcode-cn.com/problems/minimum-height-trees
最小高度树	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md
0311	https://leetcode-cn.com/problems/sparse-matrix-multiplication
稀疏矩阵的乘法	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md
0312	https://leetcode-cn.com/problems/burst-balloons
戳气球	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0312.Burst%20Balloons/README.md
0313	https://leetcode-cn.com/problems/super-ugly-number
超级丑数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0313.Super%20Ugly%20Number/README.md
0314	https://leetcode-cn.com/problems/binary-tree-vertical-order-traversal
二叉树的垂直遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md
0315	https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self
计算右侧小于当前元素的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md
0316	https://leetcode-cn.com/problems/remove-duplicate-letters
去除重复字母	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md
0317	https://leetcode-cn.com/problems/shortest-distance-from-all-buildings
离建筑物最近的距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md
0318	https://leetcode-cn.com/problems/maximum-product-of-word-lengths
最大单词长度乘积	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md
0319	https://leetcode-cn.com/problems/bulb-switcher
灯泡开关	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0319.Bulb%20Switcher/README.md
0320	https://leetcode-cn.com/problems/generalized-abbreviation
列举单词的全部缩写	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0320.Generalized%20Abbreviation/README.md
0321	https://leetcode-cn.com/problems/create-maximum-number
拼接最大数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0321.Create%20Maximum%20Number/README.md
0322	https://leetcode-cn.com/problems/coin-change
零钱兑换	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0322.Coin%20Change/README.md
0323	https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph
无向图中连通分量的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md
0324	https://leetcode-cn.com/problems/wiggle-sort-ii
摆动排序 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md
0325	https://leetcode-cn.com/problems/maximum-size-subarray-sum-equals-k
和等于 k 的最长子数组长度	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md
0326	https://leetcode-cn.com/problems/power-of-three
3 的幂	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0326.Power%20of%20Three/README.md
0327	https://leetcode-cn.com/problems/count-of-range-sum
区间和的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md
0328	https://leetcode-cn.com/problems/odd-even-linked-list
奇偶链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md
0329	https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix
矩阵中的最长递增路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md
0330	https://leetcode-cn.com/problems/patching-array
按要求补齐数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0330.Patching%20Array/README.md
0331	https://leetcode-cn.com/problems/verify-preorder-serialization-of-a-binary-tree
验证二叉树的前序序列化	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md
0332	https://leetcode-cn.com/problems/reconstruct-itinerary
重新安排行程	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md
0333	https://leetcode-cn.com/problems/largest-bst-subtree
最大 BST 子树	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md
0334	https://leetcode-cn.com/problems/increasing-triplet-subsequence
递增的三元子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md
0335	https://leetcode-cn.com/problems/self-crossing
路径交叉	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0335.Self%20Crossing/README.md
0336	https://leetcode-cn.com/problems/palindrome-pairs
回文对	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0336.Palindrome%20Pairs/README.md
0337	https://leetcode-cn.com/problems/house-robber-iii
打家劫舍 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0337.House%20Robber%20III/README.md
0338	https://leetcode-cn.com/problems/counting-bits
比特位计数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0338.Counting%20Bits/README.md
0339	https://leetcode-cn.com/problems/nested-list-weight-sum
嵌套列表权重和	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md
0340	https://leetcode-cn.com/problems/longest-substring-with-at-most-k-distinct-characters
至多包含 K 个不同字符的最长子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md
0341	https://leetcode-cn.com/problems/flatten-nested-list-iterator
扁平化嵌套列表迭代器	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md
0342	https://leetcode-cn.com/problems/power-of-four
4 的幂	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0342.Power%20of%20Four/README.md
0343	https://leetcode-cn.com/problems/integer-break
整数拆分	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0343.Integer%20Break/README.md
0344	https://leetcode-cn.com/problems/reverse-string
反转字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0344.Reverse%20String/README.md
0345	https://leetcode-cn.com/problems/reverse-vowels-of-a-string
反转字符串中的元音字母	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md
0346	https://leetcode-cn.com/problems/moving-average-from-data-stream
数据流中的移动平均值	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md
0347	https://leetcode-cn.com/problems/top-k-frequent-elements
前 K 个高频元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md
0348	https://leetcode-cn.com/problems/design-tic-tac-toe
判定井字棋胜负	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md
0349	https://leetcode-cn.com/problems/intersection-of-two-arrays
两个数组的交集	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md
0350	https://leetcode-cn.com/problems/intersection-of-two-arrays-ii
两个数组的交集 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md
0351	https://leetcode-cn.com/problems/android-unlock-patterns
安卓系统手势解锁	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md
0352	https://leetcode-cn.com/problems/data-stream-as-disjoint-intervals
将数据流变为多个不相交区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md
0353	https://leetcode-cn.com/problems/design-snake-game
贪吃蛇	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0353.Design%20Snake%20Game/README.md
0354	https://leetcode-cn.com/problems/russian-doll-envelopes
俄罗斯套娃信封问题	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md
0355	https://leetcode-cn.com/problems/design-twitter
设计推特	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0355.Design%20Twitter/README.md
0356	https://leetcode-cn.com/problems/line-reflection
直线镜像	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0356.Line%20Reflection/README.md
0357	https://leetcode-cn.com/problems/count-numbers-with-unique-digits
计算各个位数不同的数字个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md
0358	https://leetcode-cn.com/problems/rearrange-string-k-distance-apart
K 距离间隔重排字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md
0359	https://leetcode-cn.com/problems/logger-rate-limiter
日志速率限制器	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md
0360	https://leetcode-cn.com/problems/sort-transformed-array
有序转化数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md
0361	https://leetcode-cn.com/problems/bomb-enemy
轰炸敌人	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0361.Bomb%20Enemy/README.md
0362	https://leetcode-cn.com/problems/design-hit-counter
敲击计数器	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0362.Design%20Hit%20Counter/README.md
0363	https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k
矩形区域不超过 K 的最大数值和	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md
0364	https://leetcode-cn.com/problems/nested-list-weight-sum-ii
加权嵌套序列和 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md
0365	https://leetcode-cn.com/problems/water-and-jug-problem
水壶问题	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md
0366	https://leetcode-cn.com/problems/find-leaves-of-binary-tree
寻找二叉树的叶子节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md
0367	https://leetcode-cn.com/problems/valid-perfect-square
有效的完全平方数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md
0368	https://leetcode-cn.com/problems/largest-divisible-subset
最大整除子集	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md
0369	https://leetcode-cn.com/problems/plus-one-linked-list
给单链表加一	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md
0370	https://leetcode-cn.com/problems/range-addition
区间加法	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0370.Range%20Addition/README.md
0371	https://leetcode-cn.com/problems/sum-of-two-integers
两整数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md
0372	https://leetcode-cn.com/problems/super-pow
超级次方	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0372.Super%20Pow/README.md
0373	https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums
查找和最小的 K 对数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md
0374	https://leetcode-cn.com/problems/guess-number-higher-or-lower
猜数字大小	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md
0375	https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii
猜数字大小 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md
0376	https://leetcode-cn.com/problems/wiggle-subsequence
摆动序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0376.Wiggle%20Subsequence/README.md
0377	https://leetcode-cn.com/problems/combination-sum-iv
组合总和 Ⅳ	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0377.Combination%20Sum%20IV/README.md
0378	https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix
有序矩阵中第 K 小的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md
0379	https://leetcode-cn.com/problems/design-phone-directory
电话目录管理系统	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0379.Design%20Phone%20Directory/README.md
0380	https://leetcode-cn.com/problems/insert-delete-getrandom-o1
常数时间插入、删除和获取随机元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md
0381	https://leetcode-cn.com/problems/insert-delete-getrandom-o1-duplicates-allowed
O(1) 时间插入、删除和获取随机元素 - 允许重复	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md
0382	https://leetcode-cn.com/problems/linked-list-random-node
链表随机节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md
0383	https://leetcode-cn.com/problems/ransom-note
赎金信	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0383.Ransom%20Note/README.md
0384	https://leetcode-cn.com/problems/shuffle-an-array
打乱数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0384.Shuffle%20an%20Array/README.md
0385	https://leetcode-cn.com/problems/mini-parser
迷你语法分析器	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0385.Mini%20Parser/README.md
0386	https://leetcode-cn.com/problems/lexicographical-numbers
字典序排数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0386.Lexicographical%20Numbers/README.md
0387	https://leetcode-cn.com/problems/first-unique-character-in-a-string
字符串中的第一个唯一字符	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md
0388	https://leetcode-cn.com/problems/longest-absolute-file-path
文件的最长绝对路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md
0389	https://leetcode-cn.com/problems/find-the-difference
找不同	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0389.Find%20the%20Difference/README.md
0390	https://leetcode-cn.com/problems/elimination-game
消除游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0390.Elimination%20Game/README.md
0391	https://leetcode-cn.com/problems/perfect-rectangle
完美矩形	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0391.Perfect%20Rectangle/README.md
0392	https://leetcode-cn.com/problems/is-subsequence
判断子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0392.Is%20Subsequence/README.md
0393	https://leetcode-cn.com/problems/utf-8-validation
UTF-8 编码验证	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0393.UTF-8%20Validation/README.md
0394	https://leetcode-cn.com/problems/decode-string
字符串解码	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0394.Decode%20String/README.md
0395	https://leetcode-cn.com/problems/longest-substring-with-at-least-k-repeating-characters
至少有 K 个重复字符的最长子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md
0396	https://leetcode-cn.com/problems/rotate-function
旋转函数	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0396.Rotate%20Function/README.md
0397	https://leetcode-cn.com/problems/integer-replacement
整数替换	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0397.Integer%20Replacement/README.md
0398	https://leetcode-cn.com/problems/random-pick-index
随机数索引	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0398.Random%20Pick%20Index/README.md
0399	https://leetcode-cn.com/problems/evaluate-division
除法求值	https://github.com/nodeadbird/leetcode/blob/master/solution/0300-0399/0399.Evaluate%20Division/README.md
0400	https://leetcode-cn.com/problems/nth-digit
第 N 个数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0400.Nth%20Digit/README.md
0401	https://leetcode-cn.com/problems/binary-watch
二进制手表	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0401.Binary%20Watch/README.md
0402	https://leetcode-cn.com/problems/remove-k-digits
移掉 K 位数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0402.Remove%20K%20Digits/README.md
0403	https://leetcode-cn.com/problems/frog-jump
青蛙过河	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0403.Frog%20Jump/README.md
0404	https://leetcode-cn.com/problems/sum-of-left-leaves
左叶子之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md
0405	https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal
数字转换为十六进制数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md
0406	https://leetcode-cn.com/problems/queue-reconstruction-by-height
根据身高重建队列	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md
0407	https://leetcode-cn.com/problems/trapping-rain-water-ii
接雨水 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md
0408	https://leetcode-cn.com/problems/valid-word-abbreviation
有效单词缩写	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md
0409	https://leetcode-cn.com/problems/longest-palindrome
最长回文串	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0409.Longest%20Palindrome/README.md
0410	https://leetcode-cn.com/problems/split-array-largest-sum
分割数组的最大值	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md
0411	https://leetcode-cn.com/problems/minimum-unique-word-abbreviation
最短特异单词缩写	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md
0412	https://leetcode-cn.com/problems/fizz-buzz
Fizz Buzz	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0412.Fizz%20Buzz/README.md
0413	https://leetcode-cn.com/problems/arithmetic-slices
等差数列划分	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0413.Arithmetic%20Slices/README.md
0414	https://leetcode-cn.com/problems/third-maximum-number
第三大的数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0414.Third%20Maximum%20Number/README.md
0415	https://leetcode-cn.com/problems/add-strings
字符串相加	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0415.Add%20Strings/README.md
0416	https://leetcode-cn.com/problems/partition-equal-subset-sum
分割等和子集	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md
0417	https://leetcode-cn.com/problems/pacific-atlantic-water-flow
太平洋大西洋水流问题	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md
0418	https://leetcode-cn.com/problems/sentence-screen-fitting
屏幕可显示句子的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md
0419	https://leetcode-cn.com/problems/battleships-in-a-board
甲板上的战舰	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md
0420	https://leetcode-cn.com/problems/strong-password-checker
强密码检验器	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0420.Strong%20Password%20Checker/README.md
0421	https://leetcode-cn.com/problems/maximum-xor-of-two-numbers-in-an-array
数组中两个数的最大异或值	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md
0422	https://leetcode-cn.com/problems/valid-word-square
有效的单词方块	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0422.Valid%20Word%20Square/README.md
0423	https://leetcode-cn.com/problems/reconstruct-original-digits-from-english
从英文中重建数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md
0424	https://leetcode-cn.com/problems/longest-repeating-character-replacement
替换后的最长重复字符	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md
0425	https://leetcode-cn.com/problems/word-squares
单词方块	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0425.Word%20Squares/README.md
0426	https://leetcode-cn.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list
将二叉搜索树转化为排序的双向链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md
0427	https://leetcode-cn.com/problems/construct-quad-tree
建立四叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md
0428	https://leetcode-cn.com/problems/serialize-and-deserialize-n-ary-tree
序列化和反序列化 N 叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md
0429	https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal
N 叉树的层序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md
0430	https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list
扁平化多级双向链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md
0431	https://leetcode-cn.com/problems/encode-n-ary-tree-to-binary-tree
将 N 叉树编码为二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md
0432	https://leetcode-cn.com/problems/all-oone-data-structure
全 O(1) 的数据结构	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README.md
0433	https://leetcode-cn.com/problems/minimum-genetic-mutation
最小基因变化	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md
0434	https://leetcode-cn.com/problems/number-of-segments-in-a-string
字符串中的单词数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md
0435	https://leetcode-cn.com/problems/non-overlapping-intervals
无重叠区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md
0436	https://leetcode-cn.com/problems/find-right-interval
寻找右区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0436.Find%20Right%20Interval/README.md
0437	https://leetcode-cn.com/problems/path-sum-iii
路径总和 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0437.Path%20Sum%20III/README.md
0438	https://leetcode-cn.com/problems/find-all-anagrams-in-a-string
找到字符串中所有字母异位词	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md
0439	https://leetcode-cn.com/problems/ternary-expression-parser
三元表达式解析器	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md
0440	https://leetcode-cn.com/problems/k-th-smallest-in-lexicographical-order
字典序的第 K 小数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md
0441	https://leetcode-cn.com/problems/arranging-coins
排列硬币	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0441.Arranging%20Coins/README.md
0442	https://leetcode-cn.com/problems/find-all-duplicates-in-an-array
数组中重复的数据	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md
0443	https://leetcode-cn.com/problems/string-compression
压缩字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0443.String%20Compression/README.md
0444	https://leetcode-cn.com/problems/sequence-reconstruction
序列重建	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0444.Sequence%20Reconstruction/README.md
0445	https://leetcode-cn.com/problems/add-two-numbers-ii
两数相加 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md
0446	https://leetcode-cn.com/problems/arithmetic-slices-ii-subsequence
等差数列划分 II - 子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md
0447	https://leetcode-cn.com/problems/number-of-boomerangs
回旋镖的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md
0448	https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array
找到所有数组中消失的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md
0449	https://leetcode-cn.com/problems/serialize-and-deserialize-bst
序列化和反序列化二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md
0450	https://leetcode-cn.com/problems/delete-node-in-a-bst
删除二叉搜索树中的节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md
0451	https://leetcode-cn.com/problems/sort-characters-by-frequency
根据字符出现频率排序	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md
0452	https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons
用最少数量的箭引爆气球	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md
0453	https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements
最小移动次数使数组元素相等	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md
0454	https://leetcode-cn.com/problems/4sum-ii
四数相加 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0454.4Sum%20II/README.md
0455	https://leetcode-cn.com/problems/assign-cookies
分发饼干	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0455.Assign%20Cookies/README.md
0456	https://leetcode-cn.com/problems/132-pattern
132 模式	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0456.132%20Pattern/README.md
0457	https://leetcode-cn.com/problems/circular-array-loop
环形数组循环	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0457.Circular%20Array%20Loop/README.md
0458	https://leetcode-cn.com/problems/poor-pigs
可怜的小猪	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0458.Poor%20Pigs/README.md
0459	https://leetcode-cn.com/problems/repeated-substring-pattern
重复的子字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md
0460	https://leetcode-cn.com/problems/lfu-cache
LFU 缓存	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0460.LFU%20Cache/README.md
0461	https://leetcode-cn.com/problems/hamming-distance
汉明距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0461.Hamming%20Distance/README.md
0462	https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii
最少移动次数使数组元素相等 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md
0463	https://leetcode-cn.com/problems/island-perimeter
岛屿的周长	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0463.Island%20Perimeter/README.md
0464	https://leetcode-cn.com/problems/can-i-win
我能赢吗	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0464.Can%20I%20Win/README.md
0465	https://leetcode-cn.com/problems/optimal-account-balancing
最优账单平衡	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md
0466	https://leetcode-cn.com/problems/count-the-repetitions
统计重复个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0466.Count%20The%20Repetitions/README.md
0467	https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string
环绕字符串中唯一的子字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md
0468	https://leetcode-cn.com/problems/validate-ip-address
验证 IP 地址	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0468.Validate%20IP%20Address/README.md
0469	https://leetcode-cn.com/problems/convex-polygon
凸多边形	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0469.Convex%20Polygon/README.md
0470	https://leetcode-cn.com/problems/implement-rand10-using-rand7
用 Rand7() 实现 Rand10()	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md
0471	https://leetcode-cn.com/problems/encode-string-with-shortest-length
编码最短长度的字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md
0472	https://leetcode-cn.com/problems/concatenated-words
连接词	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0472.Concatenated%20Words/README.md
0473	https://leetcode-cn.com/problems/matchsticks-to-square
火柴拼正方形	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md
0474	https://leetcode-cn.com/problems/ones-and-zeroes
一和零	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md
0475	https://leetcode-cn.com/problems/heaters
供暖器	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0475.Heaters/README.md
0476	https://leetcode-cn.com/problems/number-complement
数字的补数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0476.Number%20Complement/README.md
0477	https://leetcode-cn.com/problems/total-hamming-distance
汉明距离总和	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md
0478	https://leetcode-cn.com/problems/generate-random-point-in-a-circle
在圆内随机生成点	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md
0479	https://leetcode-cn.com/problems/largest-palindrome-product
最大回文数乘积	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md
0480	https://leetcode-cn.com/problems/sliding-window-median
滑动窗口中位数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0480.Sliding%20Window%20Median/README.md
0481	https://leetcode-cn.com/problems/magical-string
神奇字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0481.Magical%20String/README.md
0482	https://leetcode-cn.com/problems/license-key-formatting
密钥格式化	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0482.License%20Key%20Formatting/README.md
0483	https://leetcode-cn.com/problems/smallest-good-base
最小好进制	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0483.Smallest%20Good%20Base/README.md
0484	https://leetcode-cn.com/problems/find-permutation
寻找排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0484.Find%20Permutation/README.md
0485	https://leetcode-cn.com/problems/max-consecutive-ones
最大连续 1 的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md
0486	https://leetcode-cn.com/problems/predict-the-winner
预测赢家	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0486.Predict%20the%20Winner/README.md
0487	https://leetcode-cn.com/problems/max-consecutive-ones-ii
最大连续 1 的个数 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md
0488	https://leetcode-cn.com/problems/zuma-game
祖玛游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0488.Zuma%20Game/README.md
0489	https://leetcode-cn.com/problems/robot-room-cleaner
扫地机器人	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md
0490	https://leetcode-cn.com/problems/the-maze
迷宫	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0490.The%20Maze/README.md
0491	https://leetcode-cn.com/problems/increasing-subsequences
递增子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0491.Increasing%20Subsequences/README.md
0492	https://leetcode-cn.com/problems/construct-the-rectangle
构造矩形	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md
0493	https://leetcode-cn.com/problems/reverse-pairs
翻转对	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0493.Reverse%20Pairs/README.md
0494	https://leetcode-cn.com/problems/target-sum
目标和	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0494.Target%20Sum/README.md
0495	https://leetcode-cn.com/problems/teemo-attacking
提莫攻击	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0495.Teemo%20Attacking/README.md
0496	https://leetcode-cn.com/problems/next-greater-element-i
下一个更大元素 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md
0497	https://leetcode-cn.com/problems/random-point-in-non-overlapping-rectangles
非重叠矩形中的随机点	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md
0498	https://leetcode-cn.com/problems/diagonal-traverse
对角线遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0498.Diagonal%20Traverse/README.md
0499	https://leetcode-cn.com/problems/the-maze-iii
迷宫 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0400-0499/0499.The%20Maze%20III/README.md
0500	https://leetcode-cn.com/problems/keyboard-row
键盘行	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0500.Keyboard%20Row/README.md
0501	https://leetcode-cn.com/problems/find-mode-in-binary-search-tree
二叉搜索树中的众数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md
0502	https://leetcode-cn.com/problems/ipo
IPO	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0502.IPO/README.md
0503	https://leetcode-cn.com/problems/next-greater-element-ii
下一个更大元素 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md
0504	https://leetcode-cn.com/problems/base-7
七进制数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0504.Base%207/README.md
0505	https://leetcode-cn.com/problems/the-maze-ii
迷宫 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0505.The%20Maze%20II/README.md
0506	https://leetcode-cn.com/problems/relative-ranks
相对名次	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0506.Relative%20Ranks/README.md
0507	https://leetcode-cn.com/problems/perfect-number
完美数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0507.Perfect%20Number/README.md
0508	https://leetcode-cn.com/problems/most-frequent-subtree-sum
出现次数最多的子树元素和	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md
0509	https://leetcode-cn.com/problems/fibonacci-number
斐波那契数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0509.Fibonacci%20Number/README.md
0510	https://leetcode-cn.com/problems/inorder-successor-in-bst-ii
二叉搜索树中的中序后继 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md
0511	https://leetcode-cn.com/problems/game-play-analysis-i
游戏玩法分析 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md
0512	https://leetcode-cn.com/problems/game-play-analysis-ii
游戏玩法分析 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md
0513	https://leetcode-cn.com/problems/find-bottom-left-tree-value
找树左下角的值	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md
0514	https://leetcode-cn.com/problems/freedom-trail
自由之路	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0514.Freedom%20Trail/README.md
0515	https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row
在每个树行中找最大值	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md
0516	https://leetcode-cn.com/problems/longest-palindromic-subsequence
最长回文子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md
0517	https://leetcode-cn.com/problems/super-washing-machines
超级洗衣机	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0517.Super%20Washing%20Machines/README.md
0518	https://leetcode-cn.com/problems/coin-change-2
零钱兑换 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0518.Coin%20Change%202/README.md
0519	https://leetcode-cn.com/problems/random-flip-matrix
随机翻转矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md
0520	https://leetcode-cn.com/problems/detect-capital
检测大写字母	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0520.Detect%20Capital/README.md
0521	https://leetcode-cn.com/problems/longest-uncommon-subsequence-i
最长特殊序列 Ⅰ	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md
0522	https://leetcode-cn.com/problems/longest-uncommon-subsequence-ii
最长特殊序列 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md
0523	https://leetcode-cn.com/problems/continuous-subarray-sum
连续的子数组和	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md
0524	https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting
通过删除字母匹配到字典里最长单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md
0525	https://leetcode-cn.com/problems/contiguous-array
连续数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0525.Contiguous%20Array/README.md
0526	https://leetcode-cn.com/problems/beautiful-arrangement
优美的排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0526.Beautiful%20Arrangement/README.md
0527	https://leetcode-cn.com/problems/word-abbreviation
单词缩写	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0527.Word%20Abbreviation/README.md
0528	https://leetcode-cn.com/problems/random-pick-with-weight
按权重随机选择	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md
0529	https://leetcode-cn.com/problems/minesweeper
扫雷游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0529.Minesweeper/README.md
0530	https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst
二叉搜索树的最小绝对差	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md
0531	https://leetcode-cn.com/problems/lonely-pixel-i
孤独像素 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md
0532	https://leetcode-cn.com/problems/k-diff-pairs-in-an-array
数组中的 K-diff 数对	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md
0533	https://leetcode-cn.com/problems/lonely-pixel-ii
孤独像素 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md
0534	https://leetcode-cn.com/problems/game-play-analysis-iii
游戏玩法分析 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md
0535	https://leetcode-cn.com/problems/encode-and-decode-tinyurl
TinyURL 的加密与解密	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md
0536	https://leetcode-cn.com/problems/construct-binary-tree-from-string
从字符串生成二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md
0537	https://leetcode-cn.com/problems/complex-number-multiplication
复数乘法	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md
0538	https://leetcode-cn.com/problems/convert-bst-to-greater-tree
把二叉搜索树转换为累加树	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md
0539	https://leetcode-cn.com/problems/minimum-time-difference
最小时间差	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md
0540	https://leetcode-cn.com/problems/single-element-in-a-sorted-array
有序数组中的单一元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md
0541	https://leetcode-cn.com/problems/reverse-string-ii
反转字符串 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0541.Reverse%20String%20II/README.md
0542	https://leetcode-cn.com/problems/01-matrix
01 矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0542.01%20Matrix/README.md
0543	https://leetcode-cn.com/problems/diameter-of-binary-tree
二叉树的直径	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md
0544	https://leetcode-cn.com/problems/output-contest-matches
输出比赛匹配对	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0544.Output%20Contest%20Matches/README.md
0545	https://leetcode-cn.com/problems/boundary-of-binary-tree
二叉树的边界	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md
0546	https://leetcode-cn.com/problems/remove-boxes
移除盒子	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0546.Remove%20Boxes/README.md
0547	https://leetcode-cn.com/problems/friend-circles
朋友圈	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0547.Friend%20Circles/README.md
0548	https://leetcode-cn.com/problems/split-array-with-equal-sum
将数组分割成和相等的子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md
0549	https://leetcode-cn.com/problems/binary-tree-longest-consecutive-sequence-ii
二叉树中最长的连续序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md
0550	https://leetcode-cn.com/problems/game-play-analysis-iv
游戏玩法分析 IV	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md
0551	https://leetcode-cn.com/problems/student-attendance-record-i
学生出勤记录 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md
0552	https://leetcode-cn.com/problems/student-attendance-record-ii
学生出勤记录 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md
0553	https://leetcode-cn.com/problems/optimal-division
最优除法	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0553.Optimal%20Division/README.md
0554	https://leetcode-cn.com/problems/brick-wall
砖墙	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0554.Brick%20Wall/README.md
0555	https://leetcode-cn.com/problems/split-concatenated-strings
分割连接字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md
0556	https://leetcode-cn.com/problems/next-greater-element-iii
下一个更大元素 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md
0557	https://leetcode-cn.com/problems/reverse-words-in-a-string-iii
反转字符串中的单词 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md
0558	https://leetcode-cn.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees
四叉树交集	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md
0559	https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree
N 叉树的最大深度	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md
0560	https://leetcode-cn.com/problems/subarray-sum-equals-k
和为 K 的子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md
0561	https://leetcode-cn.com/problems/array-partition-i
数组拆分 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0561.Array%20Partition%20I/README.md
0562	https://leetcode-cn.com/problems/longest-line-of-consecutive-one-in-matrix
矩阵中最长的连续 1 线段	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md
0563	https://leetcode-cn.com/problems/binary-tree-tilt
二叉树的坡度	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md
0564	https://leetcode-cn.com/problems/find-the-closest-palindrome
寻找最近的回文数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md
0565	https://leetcode-cn.com/problems/array-nesting
数组嵌套	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0565.Array%20Nesting/README.md
0566	https://leetcode-cn.com/problems/reshape-the-matrix
重塑矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md
0567	https://leetcode-cn.com/problems/permutation-in-string
字符串的排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0567.Permutation%20in%20String/README.md
0568	https://leetcode-cn.com/problems/maximum-vacation-days
最大休假天数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md
0569	https://leetcode-cn.com/problems/median-employee-salary
员工薪水中位数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0569.Median%20Employee%20Salary/README.md
0570	https://leetcode-cn.com/problems/managers-with-at-least-5-direct-reports
至少有 5 名直接下属的经理	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md
0571	https://leetcode-cn.com/problems/find-median-given-frequency-of-numbers
给定数字的频率查询中位数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md
0572	https://leetcode-cn.com/problems/subtree-of-another-tree
另一个树的子树	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md
0573	https://leetcode-cn.com/problems/squirrel-simulation
松鼠模拟	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0573.Squirrel%20Simulation/README.md
0574	https://leetcode-cn.com/problems/winning-candidate
当选者	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0574.Winning%20Candidate/README.md
0575	https://leetcode-cn.com/problems/distribute-candies
分糖果	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0575.Distribute%20Candies/README.md
0576	https://leetcode-cn.com/problems/out-of-boundary-paths
出界的路径数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md
0577	https://leetcode-cn.com/problems/employee-bonus
员工奖金	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0577.Employee%20Bonus/README.md
0578	https://leetcode-cn.com/problems/get-highest-answer-rate-question
查询回答率最高的问题	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md
0579	https://leetcode-cn.com/problems/find-cumulative-salary-of-an-employee
查询员工的累计薪水	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md
0580	https://leetcode-cn.com/problems/count-student-number-in-departments
统计各专业学生人数	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md
0581	https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray
最短无序连续子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md
0582	https://leetcode-cn.com/problems/kill-process
杀死进程	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0582.Kill%20Process/README.md
0583	https://leetcode-cn.com/problems/delete-operation-for-two-strings
两个字符串的删除操作	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md
0584	https://leetcode-cn.com/problems/find-customer-referee
寻找用户推荐人	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0584.Find%20Customer%20Referee/README.md
0585	https://leetcode-cn.com/problems/investments-in-2016
2016 年的投资	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0585.Investments%20in%202016/README.md
0586	https://leetcode-cn.com/problems/customer-placing-the-largest-number-of-orders
订单最多的客户	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md
0587	https://leetcode-cn.com/problems/erect-the-fence
安装栅栏	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0587.Erect%20the%20Fence/README.md
0588	https://leetcode-cn.com/problems/design-in-memory-file-system
设计内存文件系统	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md
0589	https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal
N 叉树的前序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md
0590	https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal
N 叉树的后序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md
0591	https://leetcode-cn.com/problems/tag-validator
标签验证器	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0591.Tag%20Validator/README.md
0592	https://leetcode-cn.com/problems/fraction-addition-and-subtraction
分数加减运算	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md
0593	https://leetcode-cn.com/problems/valid-square
有效的正方形	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0593.Valid%20Square/README.md
0594	https://leetcode-cn.com/problems/longest-harmonious-subsequence
最长和谐子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md
0595	https://leetcode-cn.com/problems/big-countries
大的国家	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0595.Big%20Countries/README.md
0596	https://leetcode-cn.com/problems/classes-more-than-5-students
超过 5 名学生的课	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md
0597	https://leetcode-cn.com/problems/friend-requests-i-overall-acceptance-rate
好友申请 I ：总体通过率	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0597.Friend%20Requests%20I%3A%20Overall%20Acceptance%20Rate/README.md
0598	https://leetcode-cn.com/problems/range-addition-ii
范围求和 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0598.Range%20Addition%20II/README.md
0599	https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists
两个列表的最小索引总和	https://github.com/nodeadbird/leetcode/blob/master/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md
0600	https://leetcode-cn.com/problems/non-negative-integers-without-consecutive-ones
不含连续 1 的非负整数	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md
0601	https://leetcode-cn.com/problems/human-traffic-of-stadium
体育馆的人流量	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md
0602	https://leetcode-cn.com/problems/friend-requests-ii-who-has-the-most-friends
好友申请 II ：谁有最多的好友	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0602.Friend%20Requests%20II%3A%20Who%20Has%20the%20Most%20Friends/README.md
0603	https://leetcode-cn.com/problems/consecutive-available-seats
连续空余座位	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md
0604	https://leetcode-cn.com/problems/design-compressed-string-iterator
迭代压缩字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md
0605	https://leetcode-cn.com/problems/can-place-flowers
种花问题	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0605.Can%20Place%20Flowers/README.md
0606	https://leetcode-cn.com/problems/construct-string-from-binary-tree
根据二叉树创建字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md
0607	https://leetcode-cn.com/problems/sales-person
销售员	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0607.Sales%20Person/README.md
0608	https://leetcode-cn.com/problems/tree-node
树节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0608.Tree%20Node/README.md
0609	https://leetcode-cn.com/problems/find-duplicate-file-in-system
在系统中查找重复文件	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md
0610	https://leetcode-cn.com/problems/triangle-judgement
判断三角形	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0610.Triangle%20Judgement/README.md
0611	https://leetcode-cn.com/problems/valid-triangle-number
有效三角形的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md
0612	https://leetcode-cn.com/problems/shortest-distance-in-a-plane
平面上的最近距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md
0613	https://leetcode-cn.com/problems/shortest-distance-in-a-line
直线上的最近距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md
0614	https://leetcode-cn.com/problems/second-degree-follower
二级关注者	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0614.Second%20Degree%20Follower/README.md
0615	https://leetcode-cn.com/problems/average-salary-departments-vs-company
平均工资：部门与公司比较	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0615.Average%20Salary%3A%20Departments%20VS%20Company/README.md
0616	https://leetcode-cn.com/problems/add-bold-tag-in-string
给字符串添加加粗标签	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md
0617	https://leetcode-cn.com/problems/merge-two-binary-trees
合并二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md
0618	https://leetcode-cn.com/problems/students-report-by-geography
学生地理信息报告	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md
0619	https://leetcode-cn.com/problems/biggest-single-number
只出现一次的最大数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0619.Biggest%20Single%20Number/README.md
0620	https://leetcode-cn.com/problems/not-boring-movies
有趣的电影	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0620.Not%20Boring%20Movies/README.md
0621	https://leetcode-cn.com/problems/task-scheduler
任务调度器	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0621.Task%20Scheduler/README.md
0622	https://leetcode-cn.com/problems/design-circular-queue
设计循环队列	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0622.Design%20Circular%20Queue/README.md
0623	https://leetcode-cn.com/problems/add-one-row-to-tree
在二叉树中增加一行	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md
0624	https://leetcode-cn.com/problems/maximum-distance-in-arrays
数组列表中的最大距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md
0625	https://leetcode-cn.com/problems/minimum-factorization
最小因式分解	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0625.Minimum%20Factorization/README.md
0626	https://leetcode-cn.com/problems/exchange-seats
换座位	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0626.Exchange%20Seats/README.md
0627	https://leetcode-cn.com/problems/swap-salary
交换工资	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0627.Swap%20Salary/README.md
0628	https://leetcode-cn.com/problems/maximum-product-of-three-numbers
三个数的最大乘积	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md
0629	https://leetcode-cn.com/problems/k-inverse-pairs-array
K 个逆序对数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md
0630	https://leetcode-cn.com/problems/course-schedule-iii
课程表 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0630.Course%20Schedule%20III/README.md
0631	https://leetcode-cn.com/problems/design-excel-sum-formula
设计 Excel 求和公式	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md
0632	https://leetcode-cn.com/problems/smallest-range-covering-elements-from-k-lists
最小区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md
0633	https://leetcode-cn.com/problems/sum-of-square-numbers
平方数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md
0634	https://leetcode-cn.com/problems/find-the-derangement-of-an-array
寻找数组的错位排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md
0635	https://leetcode-cn.com/problems/design-log-storage-system
设计日志存储系统	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md
0636	https://leetcode-cn.com/problems/exclusive-time-of-functions
函数的独占时间	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md
0637	https://leetcode-cn.com/problems/average-of-levels-in-binary-tree
二叉树的层平均值	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md
0638	https://leetcode-cn.com/problems/shopping-offers
大礼包	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0638.Shopping%20Offers/README.md
0639	https://leetcode-cn.com/problems/decode-ways-ii
解码方法 2	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0639.Decode%20Ways%20II/README.md
0640	https://leetcode-cn.com/problems/solve-the-equation
求解方程	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0640.Solve%20the%20Equation/README.md
0641	https://leetcode-cn.com/problems/design-circular-deque
设计循环双端队列	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0641.Design%20Circular%20Deque/README.md
0642	https://leetcode-cn.com/problems/design-search-autocomplete-system
设计搜索自动补全系统	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md
0643	https://leetcode-cn.com/problems/maximum-average-subarray-i
子数组最大平均数 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md
0644	https://leetcode-cn.com/problems/maximum-average-subarray-ii
最大平均子段和 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md
0645	https://leetcode-cn.com/problems/set-mismatch
错误的集合	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0645.Set%20Mismatch/README.md
0646	https://leetcode-cn.com/problems/maximum-length-of-pair-chain
最长数对链	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md
0647	https://leetcode-cn.com/problems/palindromic-substrings
回文子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0647.Palindromic%20Substrings/README.md
0648	https://leetcode-cn.com/problems/replace-words
单词替换	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0648.Replace%20Words/README.md
0649	https://leetcode-cn.com/problems/dota2-senate
Dota2 参议院	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0649.Dota2%20Senate/README.md
0650	https://leetcode-cn.com/problems/2-keys-keyboard
只有两个键的键盘	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md
0651	https://leetcode-cn.com/problems/4-keys-keyboard
4 键键盘	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md
0652	https://leetcode-cn.com/problems/find-duplicate-subtrees
寻找重复的子树	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md
0653	https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst
两数之和 IV - 输入 BST	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md
0654	https://leetcode-cn.com/problems/maximum-binary-tree
最大二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md
0655	https://leetcode-cn.com/problems/print-binary-tree
输出二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0655.Print%20Binary%20Tree/README.md
0656	https://leetcode-cn.com/problems/coin-path
金币路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0656.Coin%20Path/README.md
0657	https://leetcode-cn.com/problems/robot-return-to-origin
机器人能否返回原点	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md
0658	https://leetcode-cn.com/problems/find-k-closest-elements
找到 K 个最接近的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md
0659	https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences
分割数组为连续子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md
0660	https://leetcode-cn.com/problems/remove-9
移除 9	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0660.Remove%209/README.md
0661	https://leetcode-cn.com/problems/image-smoother
图片平滑器	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0661.Image%20Smoother/README.md
0662	https://leetcode-cn.com/problems/maximum-width-of-binary-tree
二叉树最大宽度	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md
0663	https://leetcode-cn.com/problems/equal-tree-partition
均匀树划分	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md
0664	https://leetcode-cn.com/problems/strange-printer
奇怪的打印机	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0664.Strange%20Printer/README.md
0665	https://leetcode-cn.com/problems/non-decreasing-array
非递减数列	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0665.Non-decreasing%20Array/README.md
0666	https://leetcode-cn.com/problems/path-sum-iv
路径和 IV	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0666.Path%20Sum%20IV/README.md
0667	https://leetcode-cn.com/problems/beautiful-arrangement-ii
优美的排列 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md
0668	https://leetcode-cn.com/problems/kth-smallest-number-in-multiplication-table
乘法表中第 k 小的数	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md
0669	https://leetcode-cn.com/problems/trim-a-binary-search-tree
修剪二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md
0670	https://leetcode-cn.com/problems/maximum-swap
最大交换	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0670.Maximum%20Swap/README.md
0671	https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree
二叉树中第二小的节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md
0672	https://leetcode-cn.com/problems/bulb-switcher-ii
灯泡开关 Ⅱ	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md
0673	https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence
最长递增子序列的个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md
0674	https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence
最长连续递增序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md
0675	https://leetcode-cn.com/problems/cut-off-trees-for-golf-event
为高尔夫比赛砍树	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md
0676	https://leetcode-cn.com/problems/implement-magic-dictionary
实现一个魔法字典	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md
0677	https://leetcode-cn.com/problems/map-sum-pairs
键值映射	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md
0678	https://leetcode-cn.com/problems/valid-parenthesis-string
有效的括号字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md
0679	https://leetcode-cn.com/problems/24-game
24 点游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0679.24%20Game/README.md
0680	https://leetcode-cn.com/problems/valid-palindrome-ii
验证回文字符串 Ⅱ	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md
0681	https://leetcode-cn.com/problems/next-closest-time
最近时刻	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0681.Next%20Closest%20Time/README.md
0682	https://leetcode-cn.com/problems/baseball-game
棒球比赛	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0682.Baseball%20Game/README.md
0683	https://leetcode-cn.com/problems/k-empty-slots
K 个空花盆	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0683.K%20Empty%20Slots/README.md
0684	https://leetcode-cn.com/problems/redundant-connection
冗余连接	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0684.Redundant%20Connection/README.md
0685	https://leetcode-cn.com/problems/redundant-connection-ii
冗余连接 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0685.Redundant%20Connection%20II/README.md
0686	https://leetcode-cn.com/problems/repeated-string-match
重复叠加字符串匹配	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0686.Repeated%20String%20Match/README.md
0687	https://leetcode-cn.com/problems/longest-univalue-path
最长同值路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md
0688	https://leetcode-cn.com/problems/knight-probability-in-chessboard
“马”在棋盘上的概率	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md
0689	https://leetcode-cn.com/problems/maximum-sum-of-3-non-overlapping-subarrays
三个无重叠子数组的最大和	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md
0690	https://leetcode-cn.com/problems/employee-importance
员工的重要性	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0690.Employee%20Importance/README.md
0691	https://leetcode-cn.com/problems/stickers-to-spell-word
贴纸拼词	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md
0692	https://leetcode-cn.com/problems/top-k-frequent-words
前 K 个高频单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md
0693	https://leetcode-cn.com/problems/binary-number-with-alternating-bits
交替位二进制数	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md
0694	https://leetcode-cn.com/problems/number-of-distinct-islands
不同岛屿的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md
0695	https://leetcode-cn.com/problems/max-area-of-island
岛屿的最大面积	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md
0696	https://leetcode-cn.com/problems/count-binary-substrings
计数二进制子串	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md
0697	https://leetcode-cn.com/problems/degree-of-an-array
数组的度	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md
0698	https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets
划分为 k 个相等的子集	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md
0699	https://leetcode-cn.com/problems/falling-squares
掉落的方块	https://github.com/nodeadbird/leetcode/blob/master/solution/0600-0699/0699.Falling%20Squares/README.md
0700	https://leetcode-cn.com/problems/search-in-a-binary-search-tree
二叉搜索树中的搜索	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md
0701	https://leetcode-cn.com/problems/insert-into-a-binary-search-tree
二叉搜索树中的插入操作	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md
0702	https://leetcode-cn.com/problems/search-in-a-sorted-array-of-unknown-size
搜索长度未知的有序数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md
0703	https://leetcode-cn.com/problems/kth-largest-element-in-a-stream
数据流中的第 K 大元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md
0704	https://leetcode-cn.com/problems/binary-search
二分查找	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0704.Binary%20Search/README.md
0705	https://leetcode-cn.com/problems/design-hashset
设计哈希集合	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0705.Design%20HashSet/README.md
0706	https://leetcode-cn.com/problems/design-hashmap
设计哈希映射	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0706.Design%20HashMap/README.md
0707	https://leetcode-cn.com/problems/design-linked-list
设计链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0707.Design%20Linked%20List/README.md
0708	https://leetcode-cn.com/problems/insert-into-a-sorted-circular-linked-list
循环有序列表的插入	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md
0709	https://leetcode-cn.com/problems/to-lower-case
转换成小写字母	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0709.To%20Lower%20Case/README.md
0710	https://leetcode-cn.com/problems/random-pick-with-blacklist
黑名单中的随机数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md
0711	https://leetcode-cn.com/problems/number-of-distinct-islands-ii
不同岛屿的数量 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md
0712	https://leetcode-cn.com/problems/minimum-ascii-delete-sum-for-two-strings
两个字符串的最小 ASCII 删除和	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md
0713	https://leetcode-cn.com/problems/subarray-product-less-than-k
乘积小于 K 的子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md
0714	https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee
买卖股票的最佳时机含手续费	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md
0715	https://leetcode-cn.com/problems/range-module
Range 模块	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0715.Range%20Module/README.md
0716	https://leetcode-cn.com/problems/max-stack
最大栈	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0716.Max%20Stack/README.md
0717	https://leetcode-cn.com/problems/1-bit-and-2-bit-characters
1 比特与 2 比特字符	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md
0718	https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray
最长重复子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md
0719	https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance
找出第 k 小的距离对	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md
0720	https://leetcode-cn.com/problems/longest-word-in-dictionary
词典中最长的单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md
0721	https://leetcode-cn.com/problems/accounts-merge
账户合并	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0721.Accounts%20Merge/README.md
0722	https://leetcode-cn.com/problems/remove-comments
删除注释	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0722.Remove%20Comments/README.md
0723	https://leetcode-cn.com/problems/candy-crush
粉碎糖果	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0723.Candy%20Crush/README.md
0724	https://leetcode-cn.com/problems/find-pivot-index
寻找数组的中心索引	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0724.Find%20Pivot%20Index/README.md
0725	https://leetcode-cn.com/problems/split-linked-list-in-parts
分隔链表	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md
0726	https://leetcode-cn.com/problems/number-of-atoms
原子的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0726.Number%20of%20Atoms/README.md
0727	https://leetcode-cn.com/problems/minimum-window-subsequence
最小窗口子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md
0728	https://leetcode-cn.com/problems/self-dividing-numbers
自除数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md
0729	https://leetcode-cn.com/problems/my-calendar-i
我的日程安排表 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0729.My%20Calendar%20I/README.md
0730	https://leetcode-cn.com/problems/count-different-palindromic-subsequences
统计不同回文子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md
0731	https://leetcode-cn.com/problems/my-calendar-ii
我的日程安排表 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0731.My%20Calendar%20II/README.md
0732	https://leetcode-cn.com/problems/my-calendar-iii
我的日程安排表 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0732.My%20Calendar%20III/README.md
0733	https://leetcode-cn.com/problems/flood-fill
图像渲染	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0733.Flood%20Fill/README.md
0734	https://leetcode-cn.com/problems/sentence-similarity
句子相似性	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0734.Sentence%20Similarity/README.md
0735	https://leetcode-cn.com/problems/asteroid-collision
行星碰撞	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0735.Asteroid%20Collision/README.md
0736	https://leetcode-cn.com/problems/parse-lisp-expression
Lisp 语法解析	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md
0737	https://leetcode-cn.com/problems/sentence-similarity-ii
句子相似性 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md
0738	https://leetcode-cn.com/problems/monotone-increasing-digits
单调递增的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md
0739	https://leetcode-cn.com/problems/daily-temperatures
每日温度	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0739.Daily%20Temperatures/README.md
0740	https://leetcode-cn.com/problems/delete-and-earn
删除与获得点数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0740.Delete%20and%20Earn/README.md
0741	https://leetcode-cn.com/problems/cherry-pickup
摘樱桃	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0741.Cherry%20Pickup/README.md
0742	https://leetcode-cn.com/problems/closest-leaf-in-a-binary-tree
二叉树最近的叶节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md
0743	https://leetcode-cn.com/problems/network-delay-time
网络延迟时间	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0743.Network%20Delay%20Time/README.md
0744	https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target
寻找比目标字母大的最小字母	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md
0745	https://leetcode-cn.com/problems/prefix-and-suffix-search
前缀和后缀搜索	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md
0746	https://leetcode-cn.com/problems/min-cost-climbing-stairs
使用最小花费爬楼梯	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md
0747	https://leetcode-cn.com/problems/largest-number-at-least-twice-of-others
至少是其他数字两倍的最大数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md
0748	https://leetcode-cn.com/problems/shortest-completing-word
最短完整词	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md
0749	https://leetcode-cn.com/problems/contain-virus
隔离病毒	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0749.Contain%20Virus/README.md
0750	https://leetcode-cn.com/problems/number-of-corner-rectangles
角矩形的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md
0751	https://leetcode-cn.com/problems/ip-to-cidr
IP 到 CIDR	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0751.IP%20to%20CIDR/README.md
0752	https://leetcode-cn.com/problems/open-the-lock
打开转盘锁	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0752.Open%20the%20Lock/README.md
0753	https://leetcode-cn.com/problems/cracking-the-safe
破解保险箱	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0753.Cracking%20the%20Safe/README.md
0754	https://leetcode-cn.com/problems/reach-a-number
到达终点数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0754.Reach%20a%20Number/README.md
0755	https://leetcode-cn.com/problems/pour-water
倒水	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0755.Pour%20Water/README.md
0756	https://leetcode-cn.com/problems/pyramid-transition-matrix
金字塔转换矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md
0757	https://leetcode-cn.com/problems/set-intersection-size-at-least-two
设置交集大小至少为 2	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md
0758	https://leetcode-cn.com/problems/bold-words-in-string
字符串中的加粗单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md
0759	https://leetcode-cn.com/problems/employee-free-time
员工空闲时间	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0759.Employee%20Free%20Time/README.md
0760	https://leetcode-cn.com/problems/find-anagram-mappings
找出变位映射	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md
0761	https://leetcode-cn.com/problems/special-binary-string
特殊的二进制序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0761.Special%20Binary%20String/README.md
0762	https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation
二进制表示中质数个计算置位	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md
0763	https://leetcode-cn.com/problems/partition-labels
划分字母区间	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0763.Partition%20Labels/README.md
0764	https://leetcode-cn.com/problems/largest-plus-sign
最大加号标志	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md
0765	https://leetcode-cn.com/problems/couples-holding-hands
情侣牵手	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md
0766	https://leetcode-cn.com/problems/toeplitz-matrix
托普利茨矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0766.Toeplitz%20Matrix/README.md
0767	https://leetcode-cn.com/problems/reorganize-string
重构字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0767.Reorganize%20String/README.md
0768	https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii
最多能完成排序的块 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md
0769	https://leetcode-cn.com/problems/max-chunks-to-make-sorted
最多能完成排序的块	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md
0770	https://leetcode-cn.com/problems/basic-calculator-iv
基本计算器 IV	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md
0771	https://leetcode-cn.com/problems/jewels-and-stones
宝石与石头	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0771.Jewels%20and%20Stones/README.md
0772	https://leetcode-cn.com/problems/basic-calculator-iii
基本计算器 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0772.Basic%20Calculator%20III/README.md
0773	https://leetcode-cn.com/problems/sliding-puzzle
滑动谜题	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0773.Sliding%20Puzzle/README.md
0774	https://leetcode-cn.com/problems/minimize-max-distance-to-gas-station
最小化去加油站的最大距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md
0775	https://leetcode-cn.com/problems/global-and-local-inversions
全局倒置与局部倒置	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md
0776	https://leetcode-cn.com/problems/split-bst
拆分二叉搜索树	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0776.Split%20BST/README.md
0777	https://leetcode-cn.com/problems/swap-adjacent-in-lr-string
在 LR 字符串中交换相邻字符	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md
0778	https://leetcode-cn.com/problems/swim-in-rising-water
水位上升的泳池中游泳	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md
0779	https://leetcode-cn.com/problems/k-th-symbol-in-grammar
第 K 个语法符号	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md
0780	https://leetcode-cn.com/problems/reaching-points
到达终点	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0780.Reaching%20Points/README.md
0781	https://leetcode-cn.com/problems/rabbits-in-forest
森林中的兔子	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md
0782	https://leetcode-cn.com/problems/transform-to-chessboard
变为棋盘	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md
0783	https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes
二叉搜索树节点最小距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md
0784	https://leetcode-cn.com/problems/letter-case-permutation
字母大小写全排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md
0785	https://leetcode-cn.com/problems/is-graph-bipartite
判断二分图	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0785.Is%20Graph%20Bipartite%3F/README.md
0786	https://leetcode-cn.com/problems/k-th-smallest-prime-fraction
第 K 个最小的素数分数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md
0787	https://leetcode-cn.com/problems/cheapest-flights-within-k-stops
K 站中转内最便宜的航班	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md
0788	https://leetcode-cn.com/problems/rotated-digits
旋转数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0788.Rotated%20Digits/README.md
0789	https://leetcode-cn.com/problems/escape-the-ghosts
逃脱阻碍者	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md
0790	https://leetcode-cn.com/problems/domino-and-tromino-tiling
多米诺和托米诺平铺	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md
0791	https://leetcode-cn.com/problems/custom-sort-string
自定义字符串排序	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0791.Custom%20Sort%20String/README.md
0792	https://leetcode-cn.com/problems/number-of-matching-subsequences
匹配子序列的单词数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md
0793	https://leetcode-cn.com/problems/preimage-size-of-factorial-zeroes-function
阶乘函数后 K 个零	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md
0794	https://leetcode-cn.com/problems/valid-tic-tac-toe-state
有效的井字游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md
0795	https://leetcode-cn.com/problems/number-of-subarrays-with-bounded-maximum
区间子数组个数	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md
0796	https://leetcode-cn.com/problems/rotate-string
旋转字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0796.Rotate%20String/README.md
0797	https://leetcode-cn.com/problems/all-paths-from-source-to-target
所有可能的路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md
0798	https://leetcode-cn.com/problems/smallest-rotation-with-highest-score
得分最高的最小轮调	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md
0799	https://leetcode-cn.com/problems/champagne-tower
香槟塔	https://github.com/nodeadbird/leetcode/blob/master/solution/0700-0799/0799.Champagne%20Tower/README.md
0800	https://leetcode-cn.com/problems/similar-rgb-color
相似 RGB 颜色	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0800.Similar%20RGB%20Color/README.md
0801	https://leetcode-cn.com/problems/minimum-swaps-to-make-sequences-increasing
使序列递增的最小交换次数	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md
0802	https://leetcode-cn.com/problems/find-eventual-safe-states
找到最终的安全状态	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md
0803	https://leetcode-cn.com/problems/bricks-falling-when-hit
打砖块	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md
0804	https://leetcode-cn.com/problems/unique-morse-code-words
唯一摩尔斯密码词	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md
0805	https://leetcode-cn.com/problems/split-array-with-same-average
数组的均值分割	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md
0806	https://leetcode-cn.com/problems/number-of-lines-to-write-string
写字符串需要的行数	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md
0807	https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline
保持城市天际线	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md
0808	https://leetcode-cn.com/problems/soup-servings
分汤	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0808.Soup%20Servings/README.md
0809	https://leetcode-cn.com/problems/expressive-words
情感丰富的文字	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0809.Expressive%20Words/README.md
0810	https://leetcode-cn.com/problems/chalkboard-xor-game
黑板异或游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md
0811	https://leetcode-cn.com/problems/subdomain-visit-count
子域名访问计数	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md
0812	https://leetcode-cn.com/problems/largest-triangle-area
最大三角形面积	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md
0813	https://leetcode-cn.com/problems/largest-sum-of-averages
最大平均值和的分组	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md
0814	https://leetcode-cn.com/problems/binary-tree-pruning
二叉树剪枝	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md
0815	https://leetcode-cn.com/problems/bus-routes
公交路线	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0815.Bus%20Routes/README.md
0816	https://leetcode-cn.com/problems/ambiguous-coordinates
模糊坐标	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md
0817	https://leetcode-cn.com/problems/linked-list-components
链表组件	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0817.Linked%20List%20Components/README.md
0818	https://leetcode-cn.com/problems/race-car
赛车	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0818.Race%20Car/README.md
0819	https://leetcode-cn.com/problems/most-common-word
最常见的单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0819.Most%20Common%20Word/README.md
0820	https://leetcode-cn.com/problems/short-encoding-of-words
单词的压缩编码	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md
0821	https://leetcode-cn.com/problems/shortest-distance-to-a-character
字符的最短距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md
0822	https://leetcode-cn.com/problems/card-flipping-game
翻转卡片游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0822.Card%20Flipping%20Game/README.md
0823	https://leetcode-cn.com/problems/binary-trees-with-factors
带因子的二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md
0824	https://leetcode-cn.com/problems/goat-latin
山羊拉丁文	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0824.Goat%20Latin/README.md
0825	https://leetcode-cn.com/problems/friends-of-appropriate-ages
适龄的朋友	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md
0826	https://leetcode-cn.com/problems/most-profit-assigning-work
安排工作以达到最大收益	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md
0827	https://leetcode-cn.com/problems/making-a-large-island
最大人工岛	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md
0828	https://leetcode-cn.com/problems/count-unique-characters-of-all-substrings-of-a-given-string
统计子串中的唯一字符	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md
0829	https://leetcode-cn.com/problems/consecutive-numbers-sum
连续整数求和	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md
0830	https://leetcode-cn.com/problems/positions-of-large-groups
较大分组的位置	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md
0831	https://leetcode-cn.com/problems/masking-personal-information
隐藏个人信息	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0831.Masking%20Personal%20Information/README.md
0832	https://leetcode-cn.com/problems/flipping-an-image
翻转图像	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0832.Flipping%20an%20Image/README.md
0833	https://leetcode-cn.com/problems/find-and-replace-in-string
字符串中的查找与替换	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md
0834	https://leetcode-cn.com/problems/sum-of-distances-in-tree
树中距离之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md
0835	https://leetcode-cn.com/problems/image-overlap
图像重叠	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0835.Image%20Overlap/README.md
0836	https://leetcode-cn.com/problems/rectangle-overlap
矩形重叠	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0836.Rectangle%20Overlap/README.md
0837	https://leetcode-cn.com/problems/new-21-game
新 21 点	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0837.New%2021%20Game/README.md
0838	https://leetcode-cn.com/problems/push-dominoes
推多米诺	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0838.Push%20Dominoes/README.md
0839	https://leetcode-cn.com/problems/similar-string-groups
相似字符串组	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0839.Similar%20String%20Groups/README.md
0840	https://leetcode-cn.com/problems/magic-squares-in-grid
矩阵中的幻方	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md
0841	https://leetcode-cn.com/problems/keys-and-rooms
钥匙和房间	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0841.Keys%20and%20Rooms/README.md
0842	https://leetcode-cn.com/problems/split-array-into-fibonacci-sequence
将数组拆分成斐波那契序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md
0843	https://leetcode-cn.com/problems/guess-the-word
猜猜这个单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0843.Guess%20the%20Word/README.md
0844	https://leetcode-cn.com/problems/backspace-string-compare
比较含退格的字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0844.Backspace%20String%20Compare/README.md
0845	https://leetcode-cn.com/problems/longest-mountain-in-array
数组中的最长山脉	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md
0846	https://leetcode-cn.com/problems/hand-of-straights
一手顺子	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0846.Hand%20of%20Straights/README.md
0847	https://leetcode-cn.com/problems/shortest-path-visiting-all-nodes
访问所有节点的最短路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md
0848	https://leetcode-cn.com/problems/shifting-letters
字母移位	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0848.Shifting%20Letters/README.md
0849	https://leetcode-cn.com/problems/maximize-distance-to-closest-person
到最近的人的最大距离	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md
0850	https://leetcode-cn.com/problems/rectangle-area-ii
矩形面积 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0850.Rectangle%20Area%20II/README.md
0851	https://leetcode-cn.com/problems/loud-and-rich
喧闹和富有	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0851.Loud%20and%20Rich/README.md
0852	https://leetcode-cn.com/problems/peak-index-in-a-mountain-array
山脉数组的峰顶索引	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md
0853	https://leetcode-cn.com/problems/car-fleet
车队	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0853.Car%20Fleet/README.md
0854	https://leetcode-cn.com/problems/k-similar-strings
相似度为 K 的字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0854.K-Similar%20Strings/README.md
0855	https://leetcode-cn.com/problems/exam-room
考场就座	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0855.Exam%20Room/README.md
0856	https://leetcode-cn.com/problems/score-of-parentheses
括号的分数	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0856.Score%20of%20Parentheses/README.md
0857	https://leetcode-cn.com/problems/minimum-cost-to-hire-k-workers
雇佣 K 名工人的最低成本	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md
0858	https://leetcode-cn.com/problems/mirror-reflection
镜面反射	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0858.Mirror%20Reflection/README.md
0859	https://leetcode-cn.com/problems/buddy-strings
亲密字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0859.Buddy%20Strings/README.md
0860	https://leetcode-cn.com/problems/lemonade-change
柠檬水找零	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0860.Lemonade%20Change/README.md
0861	https://leetcode-cn.com/problems/score-after-flipping-matrix
翻转矩阵后的得分	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md
0862	https://leetcode-cn.com/problems/shortest-subarray-with-sum-at-least-k
和至少为 K 的最短子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md
0863	https://leetcode-cn.com/problems/all-nodes-distance-k-in-binary-tree
二叉树中所有距离为 K 的结点	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md
0864	https://leetcode-cn.com/problems/shortest-path-to-get-all-keys
获取所有钥匙的最短路径	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md
0865	https://leetcode-cn.com/problems/smallest-subtree-with-all-the-deepest-nodes
具有所有最深结点的最小子树	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md
0866	https://leetcode-cn.com/problems/prime-palindrome
回文素数	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0866.Prime%20Palindrome/README.md
0867	https://leetcode-cn.com/problems/transpose-matrix
转置矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0867.Transpose%20Matrix/README.md
0868	https://leetcode-cn.com/problems/binary-gap
二进制间距	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0868.Binary%20Gap/README.md
0869	https://leetcode-cn.com/problems/reordered-power-of-2
重新排序得到 2 的幂	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md
0870	https://leetcode-cn.com/problems/advantage-shuffle
优势洗牌	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0870.Advantage%20Shuffle/README.md
0871	https://leetcode-cn.com/problems/minimum-number-of-refueling-stops
最低加油次数	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md
0872	https://leetcode-cn.com/problems/leaf-similar-trees
叶子相似的树	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md
0873	https://leetcode-cn.com/problems/length-of-longest-fibonacci-subsequence
最长的斐波那契子序列的长度	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md
0874	https://leetcode-cn.com/problems/walking-robot-simulation
模拟行走机器人	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md
0875	https://leetcode-cn.com/problems/koko-eating-bananas
爱吃香蕉的珂珂	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md
0876	https://leetcode-cn.com/problems/middle-of-the-linked-list
链表的中间结点	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md
0877	https://leetcode-cn.com/problems/stone-game
石子游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0877.Stone%20Game/README.md
0878	https://leetcode-cn.com/problems/nth-magical-number
第 N 个神奇数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0878.Nth%20Magical%20Number/README.md
0879	https://leetcode-cn.com/problems/profitable-schemes
盈利计划	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0879.Profitable%20Schemes/README.md
0880	https://leetcode-cn.com/problems/decoded-string-at-index
索引处的解码字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md
0881	https://leetcode-cn.com/problems/boats-to-save-people
救生艇	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md
0882	https://leetcode-cn.com/problems/reachable-nodes-in-subdivided-graph
细分图中的可到达结点	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md
0883	https://leetcode-cn.com/problems/projection-area-of-3d-shapes
三维形体投影面积	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md
0884	https://leetcode-cn.com/problems/uncommon-words-from-two-sentences
两句话中的不常见单词	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md
0885	https://leetcode-cn.com/problems/spiral-matrix-iii
螺旋矩阵 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md
0886	https://leetcode-cn.com/problems/possible-bipartition
可能的二分法	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0886.Possible%20Bipartition/README.md
0887	https://leetcode-cn.com/problems/super-egg-drop
鸡蛋掉落	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0887.Super%20Egg%20Drop/README.md
0888	https://leetcode-cn.com/problems/fair-candy-swap
公平的糖果交换	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md
0889	https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal
根据前序和后序遍历构造二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md
0890	https://leetcode-cn.com/problems/find-and-replace-pattern
查找和替换模式	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md
0891	https://leetcode-cn.com/problems/sum-of-subsequence-widths
子序列宽度之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md
0892	https://leetcode-cn.com/problems/surface-area-of-3d-shapes
三维形体的表面积	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md
0893	https://leetcode-cn.com/problems/groups-of-special-equivalent-strings
特殊等价字符串组	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md
0894	https://leetcode-cn.com/problems/all-possible-full-binary-trees
所有可能的满二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md
0895	https://leetcode-cn.com/problems/maximum-frequency-stack
最大频率栈	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md
0896	https://leetcode-cn.com/problems/monotonic-array
单调数列	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0896.Monotonic%20Array/README.md
0897	https://leetcode-cn.com/problems/increasing-order-search-tree
递增顺序查找树	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md
0898	https://leetcode-cn.com/problems/bitwise-ors-of-subarrays
子数组按位或操作	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md
0899	https://leetcode-cn.com/problems/orderly-queue
有序队列	https://github.com/nodeadbird/leetcode/blob/master/solution/0800-0899/0899.Orderly%20Queue/README.md
0900	https://leetcode-cn.com/problems/rle-iterator
RLE 迭代器	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0900.RLE%20Iterator/README.md
0901	https://leetcode-cn.com/problems/online-stock-span
股票价格跨度	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0901.Online%20Stock%20Span/README.md
0902	https://leetcode-cn.com/problems/numbers-at-most-n-given-digit-set
最大为 N 的数字组合	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md
0903	https://leetcode-cn.com/problems/valid-permutations-for-di-sequence
DI 序列的有效排列	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md
0904	https://leetcode-cn.com/problems/fruit-into-baskets
水果成篮	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md
0905	https://leetcode-cn.com/problems/sort-array-by-parity
按奇偶排序数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md
0906	https://leetcode-cn.com/problems/super-palindromes
超级回文数	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0906.Super%20Palindromes/README.md
0907	https://leetcode-cn.com/problems/sum-of-subarray-minimums
子数组的最小值之和	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md
0908	https://leetcode-cn.com/problems/smallest-range-i
最小差值 I	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0908.Smallest%20Range%20I/README.md
0909	https://leetcode-cn.com/problems/snakes-and-ladders
蛇梯棋	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md
0910	https://leetcode-cn.com/problems/smallest-range-ii
最小差值 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0910.Smallest%20Range%20II/README.md
0911	https://leetcode-cn.com/problems/online-election
在线选举	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0911.Online%20Election/README.md
0912	https://leetcode-cn.com/problems/sort-an-array
排序数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0912.Sort%20an%20Array/README.md
0913	https://leetcode-cn.com/problems/cat-and-mouse
猫和老鼠	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0913.Cat%20and%20Mouse/README.md
0914	https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards
卡牌分组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md
0915	https://leetcode-cn.com/problems/partition-array-into-disjoint-intervals
分割数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md
0916	https://leetcode-cn.com/problems/word-subsets
单词子集	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0916.Word%20Subsets/README.md
0917	https://leetcode-cn.com/problems/reverse-only-letters
仅仅反转字母	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md
0918	https://leetcode-cn.com/problems/maximum-sum-circular-subarray
环形子数组的最大和	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md
0919	https://leetcode-cn.com/problems/complete-binary-tree-inserter
完全二叉树插入器	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md
0920	https://leetcode-cn.com/problems/number-of-music-playlists
播放列表的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md
0921	https://leetcode-cn.com/problems/minimum-add-to-make-parentheses-valid
使括号有效的最少添加	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md
0922	https://leetcode-cn.com/problems/sort-array-by-parity-ii
按奇偶排序数组 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md
0923	https://leetcode-cn.com/problems/3sum-with-multiplicity
三数之和的多种可能	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md
0924	https://leetcode-cn.com/problems/minimize-malware-spread
尽量减少恶意软件的传播	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md
0925	https://leetcode-cn.com/problems/long-pressed-name
长按键入	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0925.Long%20Pressed%20Name/README.md
0926	https://leetcode-cn.com/problems/flip-string-to-monotone-increasing
将字符串翻转到单调递增	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md
0927	https://leetcode-cn.com/problems/three-equal-parts
三等分	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0927.Three%20Equal%20Parts/README.md
0928	https://leetcode-cn.com/problems/minimize-malware-spread-ii
尽量减少恶意软件的传播 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md
0929	https://leetcode-cn.com/problems/unique-email-addresses
独特的电子邮件地址	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md
0930	https://leetcode-cn.com/problems/binary-subarrays-with-sum
和相同的二元子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md
0931	https://leetcode-cn.com/problems/minimum-falling-path-sum
下降路径最小和	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md
0932	https://leetcode-cn.com/problems/beautiful-array
漂亮数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0932.Beautiful%20Array/README.md
0933	https://leetcode-cn.com/problems/number-of-recent-calls
最近的请求次数	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md
0934	https://leetcode-cn.com/problems/shortest-bridge
最短的桥	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0934.Shortest%20Bridge/README.md
0935	https://leetcode-cn.com/problems/knight-dialer
骑士拨号器	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0935.Knight%20Dialer/README.md
0936	https://leetcode-cn.com/problems/stamping-the-sequence
戳印序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md
0937	https://leetcode-cn.com/problems/reorder-data-in-log-files
重新排列日志文件	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md
0938	https://leetcode-cn.com/problems/range-sum-of-bst
二叉搜索树的范围和	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md
0939	https://leetcode-cn.com/problems/minimum-area-rectangle
最小面积矩形	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md
0940	https://leetcode-cn.com/problems/distinct-subsequences-ii
不同的子序列 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md
0941	https://leetcode-cn.com/problems/valid-mountain-array
有效的山脉数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md
0942	https://leetcode-cn.com/problems/di-string-match
增减字符串匹配	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0942.DI%20String%20Match/README.md
0943	https://leetcode-cn.com/problems/find-the-shortest-superstring
最短超级串	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md
0944	https://leetcode-cn.com/problems/delete-columns-to-make-sorted
删列造序	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md
0945	https://leetcode-cn.com/problems/minimum-increment-to-make-array-unique
使数组唯一的最小增量	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md
0946	https://leetcode-cn.com/problems/validate-stack-sequences
验证栈序列	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md
0947	https://leetcode-cn.com/problems/most-stones-removed-with-same-row-or-column
移除最多的同行或同列石头	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md
0948	https://leetcode-cn.com/problems/bag-of-tokens
令牌放置	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0948.Bag%20of%20Tokens/README.md
0949	https://leetcode-cn.com/problems/largest-time-for-given-digits
给定数字能组成的最大时间	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md
0950	https://leetcode-cn.com/problems/reveal-cards-in-increasing-order
按递增顺序显示卡牌	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md
0951	https://leetcode-cn.com/problems/flip-equivalent-binary-trees
翻转等价二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md
0952	https://leetcode-cn.com/problems/largest-component-size-by-common-factor
按公因数计算最大组件大小	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md
0953	https://leetcode-cn.com/problems/verifying-an-alien-dictionary
验证外星语词典	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md
0954	https://leetcode-cn.com/problems/array-of-doubled-pairs
二倍数对数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md
0955	https://leetcode-cn.com/problems/delete-columns-to-make-sorted-ii
删列造序 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md
0956	https://leetcode-cn.com/problems/tallest-billboard
最高的广告牌	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0956.Tallest%20Billboard/README.md
0957	https://leetcode-cn.com/problems/prison-cells-after-n-days
N 天后的牢房	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md
0958	https://leetcode-cn.com/problems/check-completeness-of-a-binary-tree
二叉树的完全性检验	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md
0959	https://leetcode-cn.com/problems/regions-cut-by-slashes
由斜杠划分区域	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md
0960	https://leetcode-cn.com/problems/delete-columns-to-make-sorted-iii
删列造序 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md
0961	https://leetcode-cn.com/problems/n-repeated-element-in-size-2n-array
重复 N 次的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md
0962	https://leetcode-cn.com/problems/maximum-width-ramp
最大宽度坡	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md
0963	https://leetcode-cn.com/problems/minimum-area-rectangle-ii
最小面积矩形 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md
0964	https://leetcode-cn.com/problems/least-operators-to-express-number
表示数字的最少运算符	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md
0965	https://leetcode-cn.com/problems/univalued-binary-tree
单值二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md
0966	https://leetcode-cn.com/problems/vowel-spellchecker
元音拼写检查器	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0966.Vowel%20Spellchecker/README.md
0967	https://leetcode-cn.com/problems/numbers-with-same-consecutive-differences
连续差相同的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md
0968	https://leetcode-cn.com/problems/binary-tree-cameras
监控二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md
0969	https://leetcode-cn.com/problems/pancake-sorting
煎饼排序	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0969.Pancake%20Sorting/README.md
0970	https://leetcode-cn.com/problems/powerful-integers
强整数	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0970.Powerful%20Integers/README.md
0971	https://leetcode-cn.com/problems/flip-binary-tree-to-match-preorder-traversal
翻转二叉树以匹配先序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md
0972	https://leetcode-cn.com/problems/equal-rational-numbers
相等的有理数	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md
0973	https://leetcode-cn.com/problems/k-closest-points-to-origin
最接近原点的 K 个点	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md
0974	https://leetcode-cn.com/problems/subarray-sums-divisible-by-k
和可被 K 整除的子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md
0975	https://leetcode-cn.com/problems/odd-even-jump
奇偶跳	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0975.Odd%20Even%20Jump/README.md
0976	https://leetcode-cn.com/problems/largest-perimeter-triangle
三角形的最大周长	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md
0977	https://leetcode-cn.com/problems/squares-of-a-sorted-array
有序数组的平方	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md
0978	https://leetcode-cn.com/problems/longest-turbulent-subarray
最长湍流子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md
0979	https://leetcode-cn.com/problems/distribute-coins-in-binary-tree
在二叉树中分配硬币	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md
0980	https://leetcode-cn.com/problems/unique-paths-iii
不同路径 III	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0980.Unique%20Paths%20III/README.md
0981	https://leetcode-cn.com/problems/time-based-key-value-store
基于时间的键值存储	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md
0982	https://leetcode-cn.com/problems/triples-with-bitwise-and-equal-to-zero
按位与为零的三元组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md
0983	https://leetcode-cn.com/problems/minimum-cost-for-tickets
最低票价	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md
0984	https://leetcode-cn.com/problems/string-without-aaa-or-bbb
不含 AAA 或 BBB 的字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md
0985	https://leetcode-cn.com/problems/sum-of-even-numbers-after-queries
查询后的偶数和	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md
0986	https://leetcode-cn.com/problems/interval-list-intersections
区间列表的交集	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0986.Interval%20List%20Intersections/README.md
0987	https://leetcode-cn.com/problems/vertical-order-traversal-of-a-binary-tree
二叉树的垂序遍历	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md
0988	https://leetcode-cn.com/problems/smallest-string-starting-from-leaf
从叶结点开始的最小字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md
0989	https://leetcode-cn.com/problems/add-to-array-form-of-integer
数组形式的整数加法	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md
0990	https://leetcode-cn.com/problems/satisfiability-of-equality-equations
等式方程的可满足性	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md
0991	https://leetcode-cn.com/problems/broken-calculator
坏了的计算器	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0991.Broken%20Calculator/README.md
0992	https://leetcode-cn.com/problems/subarrays-with-k-different-integers
K 个不同整数的子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md
0993	https://leetcode-cn.com/problems/cousins-in-binary-tree
二叉树的堂兄弟节点	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md
0994	https://leetcode-cn.com/problems/rotting-oranges
腐烂的橘子	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0994.Rotting%20Oranges/README.md
0995	https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips
K 连续位的最小翻转次数	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md
0996	https://leetcode-cn.com/problems/number-of-squareful-arrays
正方形数组的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md
0997	https://leetcode-cn.com/problems/find-the-town-judge
找到小镇的法官	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md
0998	https://leetcode-cn.com/problems/maximum-binary-tree-ii
最大二叉树 II	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md
0999	https://leetcode-cn.com/problems/available-captures-for-rook
可以被一步捕获的棋子数	https://github.com/nodeadbird/leetcode/blob/master/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md
1000	https://leetcode-cn.com/problems/minimum-cost-to-merge-stones
合并石头的最低成本	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md
1001	https://leetcode-cn.com/problems/grid-illumination
网格照明	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1001.Grid%20Illumination/README.md
1002	https://leetcode-cn.com/problems/find-common-characters
查找常用字符	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1002.Find%20Common%20Characters/README.md
1003	https://leetcode-cn.com/problems/check-if-word-is-valid-after-substitutions
检查替换后的词是否有效	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md
1004	https://leetcode-cn.com/problems/max-consecutive-ones-iii
最大连续 1 的个数 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md
1005	https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations
K 次取反后最大化的数组和	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md
1006	https://leetcode-cn.com/problems/clumsy-factorial
笨阶乘	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1006.Clumsy%20Factorial/README.md
1007	https://leetcode-cn.com/problems/minimum-domino-rotations-for-equal-row
行相等的最少多米诺旋转	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md
1008	https://leetcode-cn.com/problems/construct-binary-search-tree-from-preorder-traversal
先序遍历构造二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md
1009	https://leetcode-cn.com/problems/complement-of-base-10-integer
十进制整数的反码	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md
1010	https://leetcode-cn.com/problems/pairs-of-songs-with-total-durations-divisible-by-60
总持续时间可被 60 整除的歌曲	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md
1011	https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days
在 D 天内送达包裹的能力	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md
1012	https://leetcode-cn.com/problems/numbers-with-repeated-digits
至少有 1 位重复的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md
1013	https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum
将数组分成和相等的三个部分	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md
1014	https://leetcode-cn.com/problems/best-sightseeing-pair
最佳观光组合	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md
1015	https://leetcode-cn.com/problems/smallest-integer-divisible-by-k
可被 K 整除的最小整数	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md
1016	https://leetcode-cn.com/problems/binary-string-with-substrings-representing-1-to-n
子串能表示从 1 到 N 数字的二进制串	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md
1017	https://leetcode-cn.com/problems/convert-to-base-2
负二进制转换	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md
1018	https://leetcode-cn.com/problems/binary-prefix-divisible-by-5
可被 5 整除的二进制前缀	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md
1019	https://leetcode-cn.com/problems/next-greater-node-in-linked-list
链表中的下一个更大节点	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md
1020	https://leetcode-cn.com/problems/number-of-enclaves
飞地的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1020.Number%20of%20Enclaves/README.md
1021	https://leetcode-cn.com/problems/remove-outermost-parentheses
删除最外层的括号	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md
1022	https://leetcode-cn.com/problems/sum-of-root-to-leaf-binary-numbers
从根到叶的二进制数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md
1023	https://leetcode-cn.com/problems/camelcase-matching
驼峰式匹配	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1023.Camelcase%20Matching/README.md
1024	https://leetcode-cn.com/problems/video-stitching
视频拼接	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1024.Video%20Stitching/README.md
1025	https://leetcode-cn.com/problems/divisor-game
除数博弈	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1025.Divisor%20Game/README.md
1026	https://leetcode-cn.com/problems/maximum-difference-between-node-and-ancestor
节点与其祖先之间的最大差值	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md
1027	https://leetcode-cn.com/problems/longest-arithmetic-subsequence
最长等差数列	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md
1028	https://leetcode-cn.com/problems/recover-a-tree-from-preorder-traversal
从先序遍历还原二叉树	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md
1029	https://leetcode-cn.com/problems/two-city-scheduling
两地调度	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1029.Two%20City%20Scheduling/README.md
1030	https://leetcode-cn.com/problems/matrix-cells-in-distance-order
距离顺序排列矩阵单元格	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md
1031	https://leetcode-cn.com/problems/maximum-sum-of-two-non-overlapping-subarrays
两个非重叠子数组的最大和	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md
1032	https://leetcode-cn.com/problems/stream-of-characters
字符流	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1032.Stream%20of%20Characters/README.md
1033	https://leetcode-cn.com/problems/moving-stones-until-consecutive
移动石子直到连续	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md
1034	https://leetcode-cn.com/problems/coloring-a-border
边框着色	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1034.Coloring%20A%20Border/README.md
1035	https://leetcode-cn.com/problems/uncrossed-lines
不相交的线	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1035.Uncrossed%20Lines/README.md
1036	https://leetcode-cn.com/problems/escape-a-large-maze
逃离大迷宫	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md
1037	https://leetcode-cn.com/problems/valid-boomerang
有效的回旋镖	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1037.Valid%20Boomerang/README.md
1038	https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree
从二叉搜索树到更大和树	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md
1039	https://leetcode-cn.com/problems/minimum-score-triangulation-of-polygon
多边形三角剖分的最低得分	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md
1040	https://leetcode-cn.com/problems/moving-stones-until-consecutive-ii
移动石子直到连续 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md
1041	https://leetcode-cn.com/problems/robot-bounded-in-circle
困于环中的机器人	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md
1042	https://leetcode-cn.com/problems/flower-planting-with-no-adjacent
不邻接植花	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md
1043	https://leetcode-cn.com/problems/partition-array-for-maximum-sum
分隔数组以得到最大和	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md
1044	https://leetcode-cn.com/problems/longest-duplicate-substring
最长重复子串	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md
1045	https://leetcode-cn.com/problems/customers-who-bought-all-products
买下所有产品的客户	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md
1046	https://leetcode-cn.com/problems/last-stone-weight
最后一块石头的重量	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1046.Last%20Stone%20Weight/README.md
1047	https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string
删除字符串中的所有相邻重复项	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md
1048	https://leetcode-cn.com/problems/longest-string-chain
最长字符串链	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1048.Longest%20String%20Chain/README.md
1049	https://leetcode-cn.com/problems/last-stone-weight-ii
最后一块石头的重量 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md
1050	https://leetcode-cn.com/problems/actors-and-directors-who-cooperated-at-least-three-times
合作过至少三次的演员和导演	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md
1051	https://leetcode-cn.com/problems/height-checker
高度检查器	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1051.Height%20Checker/README.md
1052	https://leetcode-cn.com/problems/grumpy-bookstore-owner
爱生气的书店老板	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md
1053	https://leetcode-cn.com/problems/previous-permutation-with-one-swap
交换一次的先前排列	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md
1054	https://leetcode-cn.com/problems/distant-barcodes
距离相等的条形码	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1054.Distant%20Barcodes/README.md
1055	https://leetcode-cn.com/problems/shortest-way-to-form-string
形成字符串的最短路径	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md
1056	https://leetcode-cn.com/problems/confusing-number
易混淆数	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1056.Confusing%20Number/README.md
1057	https://leetcode-cn.com/problems/campus-bikes
校园自行车分配	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1057.Campus%20Bikes/README.md
1058	https://leetcode-cn.com/problems/minimize-rounding-error-to-meet-target
最小化舍入误差以满足目标	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md
1059	https://leetcode-cn.com/problems/all-paths-from-source-lead-to-destination
从始点到终点的所有路径	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md
1060	https://leetcode-cn.com/problems/missing-element-in-sorted-array
有序数组中的缺失元素	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md
1061	https://leetcode-cn.com/problems/lexicographically-smallest-equivalent-string
按字典序排列最小的等效字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md
1062	https://leetcode-cn.com/problems/longest-repeating-substring
最长重复子串	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md
1063	https://leetcode-cn.com/problems/number-of-valid-subarrays
有效子数组的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md
1064	https://leetcode-cn.com/problems/fixed-point
不动点	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1064.Fixed%20Point/README.md
1065	https://leetcode-cn.com/problems/index-pairs-of-a-string
字符串的索引对	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md
1066	https://leetcode-cn.com/problems/campus-bikes-ii
校园自行车分配 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1066.Campus%20Bikes%20II/README.md
1067	https://leetcode-cn.com/problems/digit-count-in-range
范围内的数字计数	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md
1068	https://leetcode-cn.com/problems/product-sales-analysis-i
产品销售分析 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md
1069	https://leetcode-cn.com/problems/product-sales-analysis-ii
产品销售分析 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md
1070	https://leetcode-cn.com/problems/product-sales-analysis-iii
产品销售分析 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md
1071	https://leetcode-cn.com/problems/greatest-common-divisor-of-strings
字符串的最大公因子	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md
1072	https://leetcode-cn.com/problems/flip-columns-for-maximum-number-of-equal-rows
按列翻转得到最大值等行数	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md
1073	https://leetcode-cn.com/problems/adding-two-negabinary-numbers
负二进制数相加	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md
1074	https://leetcode-cn.com/problems/number-of-submatrices-that-sum-to-target
元素和为目标值的子矩阵数量	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md
1075	https://leetcode-cn.com/problems/project-employees-i
项目员工 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1075.Project%20Employees%20I/README.md
1076	https://leetcode-cn.com/problems/project-employees-ii
项目员工 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1076.Project%20Employees%20II/README.md
1077	https://leetcode-cn.com/problems/project-employees-iii
项目员工 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1077.Project%20Employees%20III/README.md
1078	https://leetcode-cn.com/problems/occurrences-after-bigram
Bigram 分词	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md
1079	https://leetcode-cn.com/problems/letter-tile-possibilities
活字印刷	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md
1080	https://leetcode-cn.com/problems/insufficient-nodes-in-root-to-leaf-paths
根到叶路径上的不足节点	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md
1081	https://leetcode-cn.com/problems/smallest-subsequence-of-distinct-characters
不同字符的最小子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md
1082	https://leetcode-cn.com/problems/sales-analysis-i
销售分析 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1082.Sales%20Analysis%20I/README.md
1083	https://leetcode-cn.com/problems/sales-analysis-ii
销售分析 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1083.Sales%20Analysis%20II/README.md
1084	https://leetcode-cn.com/problems/sales-analysis-iii
销售分析 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1084.Sales%20Analysis%20III/README.md
1085	https://leetcode-cn.com/problems/sum-of-digits-in-the-minimum-number
最小元素各数位之和	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md
1086	https://leetcode-cn.com/problems/high-five
前五科的均分	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1086.High%20Five/README.md
1087	https://leetcode-cn.com/problems/brace-expansion
字母切换	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1087.Brace%20Expansion/README.md
1088	https://leetcode-cn.com/problems/confusing-number-ii
易混淆数 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1088.Confusing%20Number%20II/README.md
1089	https://leetcode-cn.com/problems/duplicate-zeros
复写零	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1089.Duplicate%20Zeros/README.md
1090	https://leetcode-cn.com/problems/largest-values-from-labels
受标签影响的最大值	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md
1091	https://leetcode-cn.com/problems/shortest-path-in-binary-matrix
二进制矩阵中的最短路径	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md
1092	https://leetcode-cn.com/problems/shortest-common-supersequence
最短公共超序列	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1092.Shortest%20Common%20Supersequence%20/README.md
1093	https://leetcode-cn.com/problems/statistics-from-a-large-sample
大样本统计	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md
1094	https://leetcode-cn.com/problems/car-pooling
拼车	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1094.Car%20Pooling/README.md
1095	https://leetcode-cn.com/problems/find-in-mountain-array
山脉数组中查找目标值	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md
1096	https://leetcode-cn.com/problems/brace-expansion-ii
花括号展开 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1096.Brace%20Expansion%20II/README.md
1097	https://leetcode-cn.com/problems/game-play-analysis-v
游戏玩法分析 V	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md
1098	https://leetcode-cn.com/problems/unpopular-books
小众书籍	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1098.Unpopular%20Books/README.md
1099	https://leetcode-cn.com/problems/two-sum-less-than-k
小于 K 的两数之和	https://github.com/nodeadbird/leetcode/blob/master/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md
1100	https://leetcode-cn.com/problems/find-k-length-substrings-with-no-repeated-characters
长度为 K 的无重复字符子串	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md
1101	https://leetcode-cn.com/problems/the-earliest-moment-when-everyone-become-friends
彼此熟识的最早时间	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md
1102	https://leetcode-cn.com/problems/path-with-maximum-minimum-value
得分最高的路径	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md
1103	https://leetcode-cn.com/problems/distribute-candies-to-people
分糖果 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md
1104	https://leetcode-cn.com/problems/path-in-zigzag-labelled-binary-tree
二叉树寻路	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md
1105	https://leetcode-cn.com/problems/filling-bookcase-shelves
填充书架	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md
1106	https://leetcode-cn.com/problems/parsing-a-boolean-expression
解析布尔表达式	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md
1107	https://leetcode-cn.com/problems/new-users-daily-count
每日新用户统计	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md
1108	https://leetcode-cn.com/problems/defanging-an-ip-address
IP 地址无效化	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md
1109	https://leetcode-cn.com/problems/corporate-flight-bookings
航班预订统计	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md
1110	https://leetcode-cn.com/problems/delete-nodes-and-return-forest
删点成林	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md
1111	https://leetcode-cn.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings
有效括号的嵌套深度	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md
1112	https://leetcode-cn.com/problems/highest-grade-for-each-student
每位学生的最高成绩	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md
1113	https://leetcode-cn.com/problems/reported-posts
报告的记录	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1113.Reported%20Posts/README.md
1114	https://leetcode-cn.com/problems/print-in-order
按序打印	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1114.Print%20in%20Order/README.md
1115	https://leetcode-cn.com/problems/print-foobar-alternately
交替打印 FooBar	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md
1116	https://leetcode-cn.com/problems/print-zero-even-odd
打印零与奇偶数	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md
1117	https://leetcode-cn.com/problems/building-h2o
H2O 生成	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1117.Building%20H2O/README.md
1118	https://leetcode-cn.com/problems/number-of-days-in-a-month
一月有多少天	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md
1119	https://leetcode-cn.com/problems/remove-vowels-from-a-string
删去字符串中的元音	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md
1120	https://leetcode-cn.com/problems/maximum-average-subtree
子树的最大平均值	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md
1121	https://leetcode-cn.com/problems/divide-array-into-increasing-sequences
将数组分成几个递增序列	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md
1122	https://leetcode-cn.com/problems/relative-sort-array
数组的相对排序	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1122.Relative%20Sort%20Array/README.md
1123	https://leetcode-cn.com/problems/lowest-common-ancestor-of-deepest-leaves
最深叶节点的最近公共祖先	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md
1124	https://leetcode-cn.com/problems/longest-well-performing-interval
表现良好的最长时间段	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md
1125	https://leetcode-cn.com/problems/smallest-sufficient-team
最小的必要团队	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md
1126	https://leetcode-cn.com/problems/active-businesses
查询活跃业务	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1126.Active%20Businesses/README.md
1127	https://leetcode-cn.com/problems/user-purchase-platform
用户购买平台	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1127.User%20Purchase%20Platform/README.md
1128	https://leetcode-cn.com/problems/number-of-equivalent-domino-pairs
等价多米诺骨牌对的数量	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md
1129	https://leetcode-cn.com/problems/shortest-path-with-alternating-colors
颜色交替的最短路径	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md
1130	https://leetcode-cn.com/problems/minimum-cost-tree-from-leaf-values
叶值的最小代价生成树	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md
1131	https://leetcode-cn.com/problems/maximum-of-absolute-value-expression
绝对值表达式的最大值	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md
1132	https://leetcode-cn.com/problems/reported-posts-ii
报告的记录 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1132.Reported%20Posts%20II/README.md
1133	https://leetcode-cn.com/problems/largest-unique-number
最大唯一数	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1133.Largest%20Unique%20Number/README.md
1134	https://leetcode-cn.com/problems/armstrong-number
阿姆斯特朗数	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1134.Armstrong%20Number/README.md
1135	https://leetcode-cn.com/problems/connecting-cities-with-minimum-cost
最低成本联通所有城市	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md
1136	https://leetcode-cn.com/problems/parallel-courses
平行课程	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1136.Parallel%20Courses/README.md
1137	https://leetcode-cn.com/problems/n-th-tribonacci-number
第 N 个泰波那契数	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md
1138	https://leetcode-cn.com/problems/alphabet-board-path
字母板上的路径	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md
1139	https://leetcode-cn.com/problems/largest-1-bordered-square
最大的以 1 为边界的正方形	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md
1140	https://leetcode-cn.com/problems/stone-game-ii
石子游戏 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1140.Stone%20Game%20II/README.md
1141	https://leetcode-cn.com/problems/user-activity-for-the-past-30-days-i
查询近 30 天活跃用户数	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md
1142	https://leetcode-cn.com/problems/user-activity-for-the-past-30-days-ii
过去 30 天的用户活动 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md
1143	https://leetcode-cn.com/problems/longest-common-subsequence
最长公共子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md
1144	https://leetcode-cn.com/problems/decrease-elements-to-make-array-zigzag
递减元素使数组呈锯齿状	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md
1145	https://leetcode-cn.com/problems/binary-tree-coloring-game
二叉树着色游戏	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md
1146	https://leetcode-cn.com/problems/snapshot-array
快照数组	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1146.Snapshot%20Array/README.md
1147	https://leetcode-cn.com/problems/longest-chunked-palindrome-decomposition
段式回文	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md
1148	https://leetcode-cn.com/problems/article-views-i
文章浏览 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1148.Article%20Views%20I/README.md
1149	https://leetcode-cn.com/problems/article-views-ii
文章浏览 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1149.Article%20Views%20II/README.md
1150	https://leetcode-cn.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array
检查一个数是否在数组中占绝大多数	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md
1151	https://leetcode-cn.com/problems/minimum-swaps-to-group-all-1s-together
最少交换次数来组合所有的 1	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md
1152	https://leetcode-cn.com/problems/analyze-user-website-visit-pattern
用户网站访问行为分析	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md
1153	https://leetcode-cn.com/problems/string-transforms-into-another-string
字符串转化	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md
1154	https://leetcode-cn.com/problems/day-of-the-year
一年中的第几天	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1154.Day%20of%20the%20Year/README.md
1155	https://leetcode-cn.com/problems/number-of-dice-rolls-with-target-sum
掷骰子的 N 种方法	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md
1156	https://leetcode-cn.com/problems/swap-for-longest-repeated-character-substring
单字符重复子串的最大长度	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md
1157	https://leetcode-cn.com/problems/online-majority-element-in-subarray
子数组中占绝大多数的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md
1158	https://leetcode-cn.com/problems/market-analysis-i
市场分析 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1158.Market%20Analysis%20I/README.md
1159	https://leetcode-cn.com/problems/market-analysis-ii
市场分析 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1159.Market%20Analysis%20II/README.md
1160	https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters
拼写单词	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md
1161	https://leetcode-cn.com/problems/maximum-level-sum-of-a-binary-tree
最大层内元素和	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md
1162	https://leetcode-cn.com/problems/as-far-from-land-as-possible
地图分析	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md
1163	https://leetcode-cn.com/problems/last-substring-in-lexicographical-order
按字典序排在最后的子串	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md
1164	https://leetcode-cn.com/problems/product-price-at-a-given-date
指定日期的产品价格	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md
1165	https://leetcode-cn.com/problems/single-row-keyboard
单行键盘	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1165.Single-Row%20Keyboard/README.md
1166	https://leetcode-cn.com/problems/design-file-system
设计文件系统	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1166.Design%20File%20System/README.md
1167	https://leetcode-cn.com/problems/minimum-cost-to-connect-sticks
连接棒材的最低费用	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md
1168	https://leetcode-cn.com/problems/optimize-water-distribution-in-a-village
水资源分配优化	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md
1169	https://leetcode-cn.com/problems/invalid-transactions
查询无效交易	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1169.Invalid%20Transactions/README.md
1170	https://leetcode-cn.com/problems/compare-strings-by-frequency-of-the-smallest-character
比较字符串最小字母出现频次	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md
1171	https://leetcode-cn.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list
从链表中删去总和值为零的连续节点	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md
1172	https://leetcode-cn.com/problems/dinner-plate-stacks
餐盘栈	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md
1173	https://leetcode-cn.com/problems/immediate-food-delivery-i
即时食物配送 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md
1174	https://leetcode-cn.com/problems/immediate-food-delivery-ii
即时食物配送 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md
1175	https://leetcode-cn.com/problems/prime-arrangements
质数排列	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1175.Prime%20Arrangements/README.md
1176	https://leetcode-cn.com/problems/diet-plan-performance
健身计划评估	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md
1177	https://leetcode-cn.com/problems/can-make-palindrome-from-substring
构建回文串检测	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md
1178	https://leetcode-cn.com/problems/number-of-valid-words-for-each-puzzle
猜字谜	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md
1179	https://leetcode-cn.com/problems/reformat-department-table
重新格式化部门表	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1179.Reformat%20Department%20Table/README.md
1180	https://leetcode-cn.com/problems/count-substrings-with-only-one-distinct-letter
统计只含单一字母的子串	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md
1181	https://leetcode-cn.com/problems/before-and-after-puzzle
前后拼接	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md
1182	https://leetcode-cn.com/problems/shortest-distance-to-target-color
与目标颜色间的最短距离	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md
1183	https://leetcode-cn.com/problems/maximum-number-of-ones
矩阵中 1 的最大数量	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md
1184	https://leetcode-cn.com/problems/distance-between-bus-stops
公交站间的距离	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md
1185	https://leetcode-cn.com/problems/day-of-the-week
一周中的第几天	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1185.Day%20of%20the%20Week/README.md
1186	https://leetcode-cn.com/problems/maximum-subarray-sum-with-one-deletion
删除一次得到子数组最大和	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md
1187	https://leetcode-cn.com/problems/make-array-strictly-increasing
使数组严格递增	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md
1188	https://leetcode-cn.com/problems/design-bounded-blocking-queue
设计有限阻塞队列	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md
1189	https://leetcode-cn.com/problems/maximum-number-of-balloons
“气球” 的最大数量	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md
1190	https://leetcode-cn.com/problems/reverse-substrings-between-each-pair-of-parentheses
反转每对括号间的子串	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md
1191	https://leetcode-cn.com/problems/k-concatenation-maximum-sum
K 次串联后最大子数组之和	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md
1192	https://leetcode-cn.com/problems/critical-connections-in-a-network
查找集群内的「关键连接」	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md
1193	https://leetcode-cn.com/problems/monthly-transactions-i
每月交易 I	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md
1194	https://leetcode-cn.com/problems/tournament-winners
锦标赛优胜者	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1194.Tournament%20Winners/README.md
1195	https://leetcode-cn.com/problems/fizz-buzz-multithreaded
交替打印字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md
1196	https://leetcode-cn.com/problems/how-many-apples-can-you-put-into-the-basket
最多可以买到的苹果数量	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md
1197	https://leetcode-cn.com/problems/minimum-knight-moves
进击的骑士	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md
1198	https://leetcode-cn.com/problems/find-smallest-common-element-in-all-rows
找出所有行中最小公共元素	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md
1199	https://leetcode-cn.com/problems/minimum-time-to-build-blocks
建造街区的最短时间	https://github.com/nodeadbird/leetcode/blob/master/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md
1200	https://leetcode-cn.com/problems/minimum-absolute-difference
最小绝对差	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md
1201	https://leetcode-cn.com/problems/ugly-number-iii
丑数 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1201.Ugly%20Number%20III/README.md
1202	https://leetcode-cn.com/problems/smallest-string-with-swaps
交换字符串中的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md
1203	https://leetcode-cn.com/problems/sort-items-by-groups-respecting-dependencies
项目管理	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md
1204	https://leetcode-cn.com/problems/last-person-to-fit-in-the-elevator
最后一个能进入电梯的人	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Elevator/README.md
1205	https://leetcode-cn.com/problems/monthly-transactions-ii
每月交易 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md
1206	https://leetcode-cn.com/problems/design-skiplist
设计跳表	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1206.Design%20Skiplist/README.md
1207	https://leetcode-cn.com/problems/unique-number-of-occurrences
独一无二的出现次数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md
1208	https://leetcode-cn.com/problems/get-equal-substrings-within-budget
尽可能使字符串相等	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md
1209	https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string-ii
删除字符串中的所有相邻重复项 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md
1210	https://leetcode-cn.com/problems/minimum-moves-to-reach-target-with-rotations
穿过迷宫的最少移动次数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md
1211	https://leetcode-cn.com/problems/queries-quality-and-percentage
查询结果的质量和占比	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md
1212	https://leetcode-cn.com/problems/team-scores-in-football-tournament
查询球队积分	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md
1213	https://leetcode-cn.com/problems/intersection-of-three-sorted-arrays
三个有序数组的交集	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md
1214	https://leetcode-cn.com/problems/two-sum-bsts
查找两棵二叉搜索树之和	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md
1215	https://leetcode-cn.com/problems/stepping-numbers
步进数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1215.Stepping%20Numbers/README.md
1216	https://leetcode-cn.com/problems/valid-palindrome-iii
验证回文字符串 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md
1217	https://leetcode-cn.com/problems/minimum-cost-to-move-chips-to-the-same-position
玩筹码	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md
1218	https://leetcode-cn.com/problems/longest-arithmetic-subsequence-of-given-difference
最长定差子序列	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md
1219	https://leetcode-cn.com/problems/path-with-maximum-gold
黄金矿工	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md
1220	https://leetcode-cn.com/problems/count-vowels-permutation
统计元音字母序列的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md
1221	https://leetcode-cn.com/problems/split-a-string-in-balanced-strings
分割平衡字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md
1222	https://leetcode-cn.com/problems/queens-that-can-attack-the-king
可以攻击国王的皇后	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md
1223	https://leetcode-cn.com/problems/dice-roll-simulation
掷骰子模拟	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md
1224	https://leetcode-cn.com/problems/maximum-equal-frequency
最大相等频率	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md
1225	https://leetcode-cn.com/problems/report-contiguous-dates
报告系统状态的连续日期	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md
1226	https://leetcode-cn.com/problems/the-dining-philosophers
哲学家进餐	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md
1227	https://leetcode-cn.com/problems/airplane-seat-assignment-probability
飞机座位分配概率	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md
1228	https://leetcode-cn.com/problems/missing-number-in-arithmetic-progression
等差数列中缺失的数字	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md
1229	https://leetcode-cn.com/problems/meeting-scheduler
安排会议日程	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1229.Meeting%20Scheduler/README.md
1230	https://leetcode-cn.com/problems/toss-strange-coins
抛掷硬币	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md
1231	https://leetcode-cn.com/problems/divide-chocolate
分享巧克力	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1231.Divide%20Chocolate/README.md
1232	https://leetcode-cn.com/problems/check-if-it-is-a-straight-line
缀点成线	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md
1233	https://leetcode-cn.com/problems/remove-sub-folders-from-the-filesystem
删除子文件夹	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md
1234	https://leetcode-cn.com/problems/replace-the-substring-for-balanced-string
替换子串得到平衡字符串	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md
1235	https://leetcode-cn.com/problems/maximum-profit-in-job-scheduling
规划兼职工作	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md
1236	https://leetcode-cn.com/problems/web-crawler
网络爬虫	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1236.Web%20Crawler/README.md
1237	https://leetcode-cn.com/problems/find-positive-integer-solution-for-a-given-equation
找出给定方程的正整数解	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md
1238	https://leetcode-cn.com/problems/circular-permutation-in-binary-representation
循环码排列	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md
1239	https://leetcode-cn.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters
串联字符串的最大长度	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md
1240	https://leetcode-cn.com/problems/tiling-a-rectangle-with-the-fewest-squares
铺瓷砖	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md
1241	https://leetcode-cn.com/problems/number-of-comments-per-post
每个帖子的评论数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md
1242	https://leetcode-cn.com/problems/web-crawler-multithreaded
多线程网页爬虫	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md
1243	https://leetcode-cn.com/problems/array-transformation
数组变换	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1243.Array%20Transformation/README.md
1244	https://leetcode-cn.com/problems/design-a-leaderboard
力扣排行榜	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md
1245	https://leetcode-cn.com/problems/tree-diameter
树的直径	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1245.Tree%20Diameter/README.md
1246	https://leetcode-cn.com/problems/palindrome-removal
删除回文子数组	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1246.Palindrome%20Removal/README.md
1247	https://leetcode-cn.com/problems/minimum-swaps-to-make-strings-equal
交换字符使得字符串相同	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md
1248	https://leetcode-cn.com/problems/count-number-of-nice-subarrays
统计「优美子数组」	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md
1249	https://leetcode-cn.com/problems/minimum-remove-to-make-valid-parentheses
移除无效的括号	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md
1250	https://leetcode-cn.com/problems/check-if-it-is-a-good-array
检查「好数组」	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md
1251	https://leetcode-cn.com/problems/average-selling-price
平均售价	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1251.Average%20Selling%20Price/README.md
1252	https://leetcode-cn.com/problems/cells-with-odd-values-in-a-matrix
奇数值单元格的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md
1253	https://leetcode-cn.com/problems/reconstruct-a-2-row-binary-matrix
重构 2 行二进制矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md
1254	https://leetcode-cn.com/problems/number-of-closed-islands
统计封闭岛屿的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md
1255	https://leetcode-cn.com/problems/maximum-score-words-formed-by-letters
得分最高的单词集合	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md
1256	https://leetcode-cn.com/problems/encode-number
加密数字	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1256.Encode%20Number/README.md
1257	https://leetcode-cn.com/problems/smallest-common-region
最小公共区域	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1257.Smallest%20Common%20Region/README.md
1258	https://leetcode-cn.com/problems/synonymous-sentences
近义词句子	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1258.Synonymous%20Sentences/README.md
1259	https://leetcode-cn.com/problems/handshakes-that-dont-cross
不相交的握手	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md
1260	https://leetcode-cn.com/problems/shift-2d-grid
二维网格迁移	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1260.Shift%202D%20Grid/README.md
1261	https://leetcode-cn.com/problems/find-elements-in-a-contaminated-binary-tree
在受污染的二叉树中查找元素	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md
1262	https://leetcode-cn.com/problems/greatest-sum-divisible-by-three
可被三整除的最大和	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md
1263	https://leetcode-cn.com/problems/minimum-moves-to-move-a-box-to-their-target-location
推箱子	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md
1264	https://leetcode-cn.com/problems/page-recommendations
页面推荐	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1264.Page%20Recommendations/README.md
1265	https://leetcode-cn.com/problems/print-immutable-linked-list-in-reverse
逆序打印不可变链表	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md
1266	https://leetcode-cn.com/problems/minimum-time-visiting-all-points
访问所有点的最小时间	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md
1267	https://leetcode-cn.com/problems/count-servers-that-communicate
统计参与通信的服务器	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md
1268	https://leetcode-cn.com/problems/search-suggestions-system
搜索推荐系统	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1268.Search%20Suggestions%20System/README.md
1269	https://leetcode-cn.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps
停在原地的方案数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md
1270	https://leetcode-cn.com/problems/all-people-report-to-the-given-manager
向公司 CEO 汇报工作的所有人	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md
1271	https://leetcode-cn.com/problems/hexspeak
十六进制魔术数字	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1271.Hexspeak/README.md
1272	https://leetcode-cn.com/problems/remove-interval
删除区间	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1272.Remove%20Interval/README.md
1273	https://leetcode-cn.com/problems/delete-tree-nodes
删除树节点	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md
1274	https://leetcode-cn.com/problems/number-of-ships-in-a-rectangle
矩形内船只的数目	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md
1275	https://leetcode-cn.com/problems/find-winner-on-a-tic-tac-toe-game
找出井字棋的获胜者	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md
1276	https://leetcode-cn.com/problems/number-of-burgers-with-no-waste-of-ingredients
不浪费原料的汉堡制作方案	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md
1277	https://leetcode-cn.com/problems/count-square-submatrices-with-all-ones
统计全为 1 的正方形子矩阵	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md
1278	https://leetcode-cn.com/problems/palindrome-partitioning-iii
分割回文串 III	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md
1279	https://leetcode-cn.com/problems/traffic-light-controlled-intersection
红绿灯路口	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md
1280	https://leetcode-cn.com/problems/students-and-examinations
学生们参加各科测试的次数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1280.Students%20and%20Examinations/README.md
1281	https://leetcode-cn.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer
整数的各位积和之差	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md
1282	https://leetcode-cn.com/problems/group-the-people-given-the-group-size-they-belong-to
用户分组	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md
1283	https://leetcode-cn.com/problems/find-the-smallest-divisor-given-a-threshold
使结果不超过阈值的最小除数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md
1284	https://leetcode-cn.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix
转化为全零矩阵的最少反转次数	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md
1285	https://leetcode-cn.com/problems/find-the-start-and-end-number-of-continuous-ranges
找到连续区间的开始和结束数字	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md
1286	https://leetcode-cn.com/problems/iterator-for-combination
字母组合迭代器	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1286.Iterator%20for%20Combination/README.md
1287	https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array
有序数组中出现次数超过 25%的元素	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md
1288	https://leetcode-cn.com/problems/remove-covered-intervals
删除被覆盖区间	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md
1289	https://leetcode-cn.com/problems/minimum-falling-path-sum-ii
下降路径最小和 II	https://github.com/nodeadbird/leetcode/blob/master/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md
	https://github.com
Terms	https://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacy	https://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Security	https://github.com/security
Status	https://www.githubstatus.com/
Community	https://github.community/
Docs	https://docs.github.com/
Contact	https://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.