René's URL Explorer Experiment

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

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

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

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

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

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

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

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:127ee5b1-f2a2-b4c6-d2da-37a568781ead
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	8E0E:AAA48:1084BE2:1676037:6A59510D
html-safe-nonce	d6f10c2885e102eff8eeb88afc73bdb2430ff79a669b6744185c941911bd401e
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4RTBFOkFBQTQ4OjEwODRCRTI6MTY3NjAzNzo2QTU5NTEwRCIsInZpc2l0b3JfaWQiOiIxNDMxNDk2NDQ4MTY5MDM4MDkzIiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac	a7888b434e8c9d84c67534106cccce19e77ccda7c3d98ecdd1a32fa55cf59cdc
hovercard-subject-tag	repository:435731597
github-keyboard-shortcuts	repository,copilot
google-site-verification	Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-url	https://collector.github.com/github/collect
analytics-location	//
fb:app_id	1401488693436528
apple-itunes-app	app-id=1477376905, app-argument=https://github.com/holyant/leetcode
twitter:image	https://opengraph.githubassets.com/afcb47f39ffcdd9bbb5c3e7ffe21a84a2d08b85c8e1ead611911c9d117a868c8/holyant/leetcode
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/afcb47f39ffcdd9bbb5c3e7ffe21a84a2d08b85c8e1ead611911c9d117a868c8/holyant/leetcode
og:image:alt	😏 LeetCode solutions in any programming language \| 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - holyant/leetcode
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	a540949572872b935b393b36db38922db390ae71c859537d741b8f3eb7e545b5
turbo-cache-control	no-cache
go-import	github.com/holyant/leetcode git https://github.com/holyant/leetcode.git
octolytics-dimension-user_id	7855366
octolytics-dimension-user_login	holyant
octolytics-dimension-repository_id	435731597
octolytics-dimension-repository_nwo	holyant/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	5f35ad1fb16417d6e6774c537b62a2fe92222907
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/holyant/leetcode#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fholyant%2Fleetcode
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%2Fholyant%2Fleetcode
Sign up	https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=holyant%2Fleetcode
Reload	https://github.com/holyant/leetcode
Reload	https://github.com/holyant/leetcode
Reload	https://github.com/holyant/leetcode
holyant	https://github.com/holyant
leetcode	https://github.com/holyant/leetcode
doocs/leetcode	https://github.com/doocs/leetcode
Notifications	https://github.com/login?return_to=%2Fholyant%2Fleetcode
Fork 0	https://github.com/login?return_to=%2Fholyant%2Fleetcode
Star 0	https://github.com/login?return_to=%2Fholyant%2Fleetcode
Code	https://github.com/holyant/leetcode
Pull requests 0	https://github.com/holyant/leetcode/pulls
Actions	https://github.com/holyant/leetcode/actions
Projects	https://github.com/holyant/leetcode/projects
Security and quality 0	https://github.com/holyant/leetcode/security
Insights	https://github.com/holyant/leetcode/pulse
Code	https://github.com/holyant/leetcode
Pull requests	https://github.com/holyant/leetcode/pulls
Actions	https://github.com/holyant/leetcode/actions
Projects	https://github.com/holyant/leetcode/projects
Security and quality	https://github.com/holyant/leetcode/security
Insights	https://github.com/holyant/leetcode/pulse
	https://github.com/holyant/leetcode
Branches	https://github.com/holyant/leetcode/branches
Tags	https://github.com/holyant/leetcode/tags
	https://github.com/holyant/leetcode/branches
	https://github.com/holyant/leetcode/tags
3,645 Commits	https://github.com/holyant/leetcode/commits/main/
	https://github.com/holyant/leetcode/commits/main/
.github	https://github.com/holyant/leetcode/tree/main/.github
.github	https://github.com/holyant/leetcode/tree/main/.github
basic	https://github.com/holyant/leetcode/tree/main/basic
basic	https://github.com/holyant/leetcode/tree/main/basic
images	https://github.com/holyant/leetcode/tree/main/images
images	https://github.com/holyant/leetcode/tree/main/images
lcci	https://github.com/holyant/leetcode/tree/main/lcci
lcci	https://github.com/holyant/leetcode/tree/main/lcci
lcof	https://github.com/holyant/leetcode/tree/main/lcof
lcof	https://github.com/holyant/leetcode/tree/main/lcof
lcof2	https://github.com/holyant/leetcode/tree/main/lcof2
lcof2	https://github.com/holyant/leetcode/tree/main/lcof2
lcp	https://github.com/holyant/leetcode/tree/main/lcp
lcp	https://github.com/holyant/leetcode/tree/main/lcp
lcs	https://github.com/holyant/leetcode/tree/main/lcs
lcs	https://github.com/holyant/leetcode/tree/main/lcs
solution	https://github.com/holyant/leetcode/tree/main/solution
solution	https://github.com/holyant/leetcode/tree/main/solution
.docsifytopdfrc.js	https://github.com/holyant/leetcode/blob/main/.docsifytopdfrc.js
.docsifytopdfrc.js	https://github.com/holyant/leetcode/blob/main/.docsifytopdfrc.js
.gitignore	https://github.com/holyant/leetcode/blob/main/.gitignore
.gitignore	https://github.com/holyant/leetcode/blob/main/.gitignore
.nojekyll	https://github.com/holyant/leetcode/blob/main/.nojekyll
.nojekyll	https://github.com/holyant/leetcode/blob/main/.nojekyll
CODE_OF_CONDUCT.md	https://github.com/holyant/leetcode/blob/main/CODE_OF_CONDUCT.md
CODE_OF_CONDUCT.md	https://github.com/holyant/leetcode/blob/main/CODE_OF_CONDUCT.md
LICENSE	https://github.com/holyant/leetcode/blob/main/LICENSE
LICENSE	https://github.com/holyant/leetcode/blob/main/LICENSE
README.md	https://github.com/holyant/leetcode/blob/main/README.md
README.md	https://github.com/holyant/leetcode/blob/main/README.md
README_EN.md	https://github.com/holyant/leetcode/blob/main/README_EN.md
README_EN.md	https://github.com/holyant/leetcode/blob/main/README_EN.md
index.html	https://github.com/holyant/leetcode/blob/main/index.html
index.html	https://github.com/holyant/leetcode/blob/main/index.html
package.json	https://github.com/holyant/leetcode/blob/main/package.json
package.json	https://github.com/holyant/leetcode/blob/main/package.json
summary.md	https://github.com/holyant/leetcode/blob/main/summary.md
summary.md	https://github.com/holyant/leetcode/blob/main/summary.md
summary_en.md	https://github.com/holyant/leetcode/blob/main/summary_en.md
summary_en.md	https://github.com/holyant/leetcode/blob/main/summary_en.md
yarn.lock	https://github.com/holyant/leetcode/blob/main/yarn.lock
yarn.lock	https://github.com/holyant/leetcode/blob/main/yarn.lock
README	https://github.com/holyant/leetcode
Code of conduct	https://github.com/holyant/leetcode
CC-BY-SA-4.0 license	https://github.com/holyant/leetcode
	https://github.com/doocs/leetcode
	https://github.com/doocs/leetcode
	https://doocs.github.io/#/?id=how-to-join
	https://github.com/doocs/leetcode/blob/main/LICENSE
	https://opencollective.com/doocs-leetcode/backers/badge.svg
	https://github.com/doocs/leetcode/stargazers
	https://github.com/doocs/leetcode/network/members
	https://opencollective.com/doocs-leetcode/sponsors/badge.svg
	https://github.com/holyant/leetcode#介绍
本项目	https://github.com/doocs/leetcode
English Version	https://github.com/holyant/leetcode/blob/main/README_EN.md
	https://github.com/holyant/leetcode#站点
https://lc.netlify.app	https://lc.netlify.app
https://doocs.github.io/leetcode	https://doocs.github.io/leetcode
	https://github.com/holyant/leetcode#leetcode-全解
LeetCode	https://github.com/holyant/leetcode/blob/main/solution/README.md
LeetCode 《剑指 Offer（第 2 版）》	https://github.com/holyant/leetcode/blob/main/lcof/README.md
LeetCode 《剑指 Offer（专项突击版）》	https://github.com/holyant/leetcode/blob/main/lcof2/README.md
LeetCode 《程序员面试金典（第 6 版）》	https://github.com/holyant/leetcode/blob/main/lcci/README.md
	https://github.com/holyant/leetcode#基础算法通关
	https://github.com/holyant/leetcode#排序算法
冒泡排序	https://github.com/holyant/leetcode/blob/main/basic/sorting/BubbleSort/README.md
插入排序	https://github.com/holyant/leetcode/blob/main/basic/sorting/InsertionSort/README.md
选择排序	https://github.com/holyant/leetcode/blob/main/basic/sorting/SelectionSort/README.md
归并排序（算法模板）	https://github.com/holyant/leetcode/blob/main/basic/sorting/MergeSort/README.md
快速排序（算法模板）	https://github.com/holyant/leetcode/blob/main/basic/sorting/QuickSort/README.md
希尔排序	https://github.com/holyant/leetcode/blob/main/basic/sorting/ShellSort/README.md
堆排序（算法模板）	https://github.com/holyant/leetcode/blob/main/basic/sorting/HeapSort/README.md
	https://github.com/holyant/leetcode#查找算法
二分查找（算法模板）	https://github.com/holyant/leetcode/blob/main/basic/searching/BinarySearch/README.md
	https://github.com/holyant/leetcode#高频考题
	https://github.com/holyant/leetcode#数组
多数元素	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0169.Majority%20Element/README.md
删除排序数组中的重复项	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md
删除排序数组中的重复项 II	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md
移除元素	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0027.Remove%20Element/README.md
移动零	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0283.Move%20Zeroes/README.md
数组中重复的数字	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9803.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md
旋转数组	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0189.Rotate%20Array/README.md
螺旋矩阵	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0054.Spiral%20Matrix/README.md
两数之和	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0001.Two%20Sum/README.md
三数之和	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0015.3Sum/README.md
四数之和	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0018.4Sum/README.md
较小的三数之和	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0259.3Sum%20Smaller/README.md
最接近的三数之和	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0016.3Sum%20Closest/README.md
合并两个有序数组	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md
寻找旋转排序数组中的最小值	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md
寻找旋转排序数组中的最小值 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md
除自身以外数组的乘积	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md
	https://github.com/holyant/leetcode#字符串
无重复字符的最长子串	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md
最长公共前缀	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md
反转字符串中的元音字母	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md
字符串转换整数 (atoi)	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md
赎金信	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0383.Ransom%20Note/README.md
	https://github.com/holyant/leetcode#链表
两数相加	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0002.Add%20Two%20Numbers/README.md
两数相加 II	https://github.com/holyant/leetcode/blob/main/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md
从尾到头打印链表	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9806.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8/README.md
删除链表中的节点	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md
删除排序链表中的重复元素	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md
删除排序链表中的重复元素 II	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md
移除链表元素	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md
链表中倒数第 k 个节点	https://github.com/holyant/leetcode/blob/main/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README.md
两两交换链表中的节点	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md
合并两个有序链表	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md
合并 K 个排序链表	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md
对链表进行插入排序	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0147.Insertion%20Sort%20List/README.md
排序链表	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0148.Sort%20List/README.md
反转链表	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0206.Reverse%20Linked%20List/README.md
反转链表 II	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md
重排链表	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0143.Reorder%20List/README.md
旋转链表	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0061.Rotate%20List/README.md
回文链表	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md
相交链表	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md
奇偶链表	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md
环形链表	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0141.Linked%20List%20Cycle/README.md
环形链表 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md
设计链表	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0707.Design%20Linked%20List/README.md
	https://github.com/holyant/leetcode#二叉树
二叉树的前序遍历	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md
二叉树的后序遍历	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md
二叉树的中序遍历	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md
对称二叉树	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0101.Symmetric%20Tree/README.md
树的子结构	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9826.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84/README.md
翻转二叉树	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md
二叉树的层次遍历	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md
二叉树的层次遍历 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md
二叉树的右视图	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md
二叉树的最大深度	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md
二叉树的最小深度	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md
二叉树的所有路径	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md
路径总和	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0112.Path%20Sum/README.md
路径总和 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0113.Path%20Sum%20II/README.md
从前序与中序遍历序列构造二叉树	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md
从中序与后序遍历序列构造二叉树	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md
二叉搜索树的后序遍历序列	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9833.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97/README.md
二叉搜索树迭代器	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md
二叉树的最近公共祖先	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md
二叉搜索树的最近公共祖先	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md
将二叉搜索树转换为单链表	https://github.com/holyant/leetcode/blob/main/lcci/17.12.BiNode/README.md
将二叉搜索树转化为排序的双向链表	https://github.com/holyant/leetcode/blob/main/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md
二叉树的边界	https://github.com/holyant/leetcode/blob/main/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md
填充每个节点的下一个右侧节点指针	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md
填充每个节点的下一个右侧节点指针 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md
	https://github.com/holyant/leetcode#数学
整数转罗马数字	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0012.Integer%20to%20Roman/README.md
罗马数字转整数	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0013.Roman%20to%20Integer/README.md
只出现一次的数字	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0136.Single%20Number/README.md
只出现一次的数字 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0137.Single%20Number%20II/README.md
只出现一次的数字 III	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0260.Single%20Number%20III/README.md
错误的集合	https://github.com/holyant/leetcode/blob/main/solution/0600-0699/0645.Set%20Mismatch/README.md
位 1 的个数	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0191.Number%20of%201%20Bits/README.md
计数质数	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0204.Count%20Primes/README.md
不用加减乘除做加法	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9865.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E5%81%9A%E5%8A%A0%E6%B3%95/README.md
丢失的数字	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0268.Missing%20Number/README.md
	https://github.com/holyant/leetcode#栈和队列
有效的括号	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0020.Valid%20Parentheses/README.md
最小栈	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0155.Min%20Stack/README.md
队列的最大值	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20II.%20%E9%98%9F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/README.md
用栈实现队列	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md
用队列实现栈	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md
逆波兰表达式求值	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md
最近的请求次数	https://github.com/holyant/leetcode/blob/main/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md
每日温度	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0739.Daily%20Temperatures/README.md
基本计算器 II	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0227.Basic%20Calculator%20II/README.md
下一个更大元素 I	https://github.com/holyant/leetcode/blob/main/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md
下一个更大元素 II	https://github.com/holyant/leetcode/blob/main/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md
	https://github.com/holyant/leetcode#动态规划
斐波那契数	https://github.com/holyant/leetcode/blob/main/solution/0500-0599/0509.Fibonacci%20Number/README.md
第 N 个泰波那契数	https://github.com/holyant/leetcode/blob/main/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md
爬楼梯	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0070.Climbing%20Stairs/README.md
使用最小花费爬楼梯	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md
打家劫舍	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0198.House%20Robber/README.md
打家劫舍 II	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0213.House%20Robber%20II/README.md
删除并获得点数	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0740.Delete%20and%20Earn/README.md
跳跃游戏	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0055.Jump%20Game/README.md
跳跃游戏 II	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README.md
最大子序和	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0053.Maximum%20Subarray/README.md
环形子数组的最大和	https://github.com/holyant/leetcode/blob/main/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md
乘积最大子序列	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md
乘积为正数的最长子数组长度	https://github.com/holyant/leetcode/blob/main/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md
最佳观光组合	https://github.com/holyant/leetcode/blob/main/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md
买卖股票的最佳时机	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md
买卖股票的最佳时机 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md
买卖股票的最佳时机 III	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md
最佳买卖股票时机含冷冻期	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md
买卖股票的最佳时机含手续费	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md
单词拆分	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0139.Word%20Break/README.md
接雨水	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md
等差数列划分	https://github.com/holyant/leetcode/blob/main/solution/0400-0499/0413.Arithmetic%20Slices/README.md
解码方法	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0091.Decode%20Ways/README.md
不同的二叉搜索树	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md
丑数 II	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0264.Ugly%20Number%20II/README.md
杨辉三角	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md
杨辉三角 II	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md
下降路径最小和	https://github.com/holyant/leetcode/blob/main/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md
三角形最小路径和	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0120.Triangle/README.md
矩阵区域和	https://github.com/holyant/leetcode/blob/main/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md
二维区域和检索 - 矩阵不可变	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md
不同路径	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0062.Unique%20Paths/README.md
不同路径 II	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0063.Unique%20Paths%20II/README.md
最小路径和	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md
最长回文子串	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md
最长回文子序列	https://github.com/holyant/leetcode/blob/main/.solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md
最长递增子序列	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md
摆动序列	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0376.Wiggle%20Subsequence/README.md
最长公共子序列	https://github.com/holyant/leetcode/blob/main/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md
编辑距离	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0072.Edit%20Distance/README.md
零钱兑换	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0322.Coin%20Change/README.md
零钱兑换 II	https://github.com/holyant/leetcode/blob/main/solution/0500-0599/0518.Coin%20Change%202/README.md
组合总和 Ⅳ	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0377.Combination%20Sum%20IV/README.md
整数拆分	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0343.Integer%20Break/README.md
完全平方数	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0279.Perfect%20Squares/README.md
礼物的最大价值	https://github.com/holyant/leetcode/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9847.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/README.md
俄罗斯套娃信封问题	https://github.com/holyant/leetcode/blob/main/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md
	https://github.com/holyant/leetcode#回溯算法
子集	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0078.Subsets/README.md
子集 II	https://github.com/holyant/leetcode/blob/main/solution/0000-0099/0090.Subsets%20II/README.md
	https://github.com/holyant/leetcode#并查集
被围绕的区域	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0130.Surrounded%20Regions/README.md
省份数量	https://github.com/holyant/leetcode/blob/main/solution/0500-0599/0547.Number%20of%20Provinces/README.md
冗余连接	https://github.com/holyant/leetcode/blob/main/solution/0600-0699/0684.Redundant%20Connection/README.md
可能的二分法	https://github.com/holyant/leetcode/blob/main/solution/0800-0899/0886.Possible%20Bipartition/README.md
	https://github.com/holyant/leetcode#设计
LRU 缓存机制	https://github.com/holyant/leetcode/blob/main/solution/0100-0199/0146.Lru%20Cache/README.md
实现 Trie (前缀树)	https://github.com/holyant/leetcode/blob/main/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md
实现 Trie （前缀树） II	https://github.com/holyant/leetcode/blob/main/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md
设计循环队列	https://github.com/holyant/leetcode/blob/main/solution/0600-0699/0622.Design%20Circular%20Queue/README.md
设计循环双端队列	https://github.com/holyant/leetcode/blob/main/solution/0600-0699/0641.Design%20Circular%20Deque/README.md
设计哈希集合	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0705.Design%20HashSet/README.md
设计哈希映射	https://github.com/holyant/leetcode/blob/main/solution/0700-0799/0706.Design%20HashMap/README.md
	https://github.com/holyant/leetcode#维护者
Yang Libin	https://github.com/yanglbme
Mao Longlong	https://github.com/MaoLongLong
	https://github.com/holyant/leetcode#加入我们
@kfstorm	https://github.com/kfstorm
C# 题解	https://github.com/doocs/leetcode/pull/245
PR	https://github.com/doocs/leetcode/pulls
https://help.github.com/cn	https://help.github.com/cn
	https://github.com/doocs/leetcode
Gitpod.io	https://www.gitpod.io
	https://gitpod.io/#https://github.com/doocs/leetcode
	https://github.com/holyant/leetcode#stars-趋势
	https://github.com/doocs/leetcode/stargazers
	https://github.com/holyant/leetcode#贡献者
	https://github.com/doocs/leetcode/graphs/contributors
	https://github.com/holyant/leetcode#赞助者
	https://opencollective.com/doocs-leetcode/backers.svg?width=890
	https://opencollective.com/doocs-leetcode/sponsors.svg?width=890
Alan Yessenbayev	https://opencollective.com/alan-yessenbayev
	https://github.com/holyant/leetcode#推荐者
@爱可可-爱生活	https://weibo.com/fly51fly
	https://weibo.com/fly51fly
	https://github.com/holyant/leetcode#许可证
知识共享版权归属-相同方式共享 4.0 国际公共许可证	http://creativecommons.org/licenses/by-sa/4.0/
doocs.github.io/leetcode	https://doocs.github.io/leetcode
Readme	https://github.com/holyant/leetcode#readme-ov-file
CC-BY-SA-4.0 license	https://github.com/holyant/leetcode#CC-BY-SA-4.0-1-ov-file
Code of conduct	https://github.com/holyant/leetcode#coc-ov-file
Please reload this page	https://github.com/holyant/leetcode
Activity	https://github.com/holyant/leetcode/activity
0 forks	https://github.com/holyant/leetcode/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fholyant%2Fleetcode&report=holyant+%28user%29
Releases	https://github.com/holyant/leetcode/releases
18 tags	https://github.com/holyant/leetcode/tags
Packages 0	https://github.com/users/holyant/packages?repo_name=leetcode
Please reload this page	https://github.com/holyant/leetcode
Contributors	https://github.com/holyant/leetcode/graphs/contributors
Please reload this page	https://github.com/holyant/leetcode
	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.