René's URL Explorer Experiment

Title: GitHub - Pidunn/AlgorithmAndDataStructure: 互联网行业研发岗面试必备算法题配图解析及代码

Open Graph Title: GitHub - Pidunn/AlgorithmAndDataStructure: 互联网行业研发岗面试必备算法题配图解析及代码

X Title: GitHub - Pidunn/AlgorithmAndDataStructure: 互联网行业研发岗面试必备算法题配图解析及代码

Description: 互联网行业研发岗面试必备算法题配图解析及代码. Contribute to Pidunn/AlgorithmAndDataStructure development by creating an account on GitHub.

Open Graph Description: 互联网行业研发岗面试必备算法题配图解析及代码. Contribute to Pidunn/AlgorithmAndDataStructure development by creating an account on GitHub.

X Description: 互联网行业研发岗面试必备算法题配图解析及代码. Contribute to Pidunn/AlgorithmAndDataStructure development by creating an account on GitHub.

Opengraph URL: https://github.com/Pidunn/AlgorithmAndDataStructure

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:483496a1-7591-21e9-0607-d0ffcfe11272
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	CF0E:E4BCC:65DFCA:8B388A:698246CF
html-safe-nonce	d7579107027592c3ca61696601358bbe4f809ac118f6ee5226268568845c198b
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDRjBFOkU0QkNDOjY1REZDQTo4QjM4OEE6Njk4MjQ2Q0YiLCJ2aXNpdG9yX2lkIjoiNDU2NzA0NjU0ODE4OTQ5NzAzOSIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac	96f6aa8c24bd118d38ff4c3102a4a53880b4c640a232fbee5063a99a52322951
hovercard-subject-tag	repository:230437807
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/Pidunn/AlgorithmAndDataStructure
twitter:image	https://opengraph.githubassets.com/2d19e9c602475d6080e0e4e285ae10151909ddd0b456ae9786b0aa89c77f3949/Pidunn/AlgorithmAndDataStructure
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/2d19e9c602475d6080e0e4e285ae10151909ddd0b456ae9786b0aa89c77f3949/Pidunn/AlgorithmAndDataStructure
og:image:alt	互联网行业研发岗面试必备算法题配图解析及代码. Contribute to Pidunn/AlgorithmAndDataStructure development by creating an account on GitHub.
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	e2ebc70d7d37443ffd1ae8f91a253417e0725a69916687ec3b823f2451fb6caa
turbo-cache-control	no-preview
go-import	github.com/Pidunn/AlgorithmAndDataStructure git https://github.com/Pidunn/AlgorithmAndDataStructure.git
octolytics-dimension-user_id	41996033
octolytics-dimension-user_login	Pidunn
octolytics-dimension-repository_id	230437807
octolytics-dimension-repository_nwo	Pidunn/AlgorithmAndDataStructure
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	167775338
octolytics-dimension-repository_parent_nwo	DmrfCoder/AlgorithmAndDataStructure
octolytics-dimension-repository_network_root_id	167775338
octolytics-dimension-repository_network_root_nwo	DmrfCoder/AlgorithmAndDataStructure
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	6241ad74f49cf194bf94dad6a72d8792f1c2ab10
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/Pidunn/AlgorithmAndDataStructure#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FPidunn%2FAlgorithmAndDataStructure
GitHub CopilotWrite better code with AI	https://github.com/features/copilot
GitHub SparkBuild and deploy intelligent apps	https://github.com/features/spark
GitHub ModelsManage and compare prompts	https://github.com/features/models
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
GitHub SponsorsFund open source developers	https://github.com/sponsors
Security Lab	https://securitylab.github.com
Maintainer Community	https://maintainers.github.com
Accelerator	https://github.com/accelerator
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/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%2FPidunn%2FAlgorithmAndDataStructure
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=Pidunn%2FAlgorithmAndDataStructure
Reload	https://github.com/Pidunn/AlgorithmAndDataStructure
Reload	https://github.com/Pidunn/AlgorithmAndDataStructure
Reload	https://github.com/Pidunn/AlgorithmAndDataStructure
Pidunn	https://github.com/Pidunn
AlgorithmAndDataStructure	https://github.com/Pidunn/AlgorithmAndDataStructure
DmrfCoder/AlgorithmAndDataStructure	https://github.com/DmrfCoder/AlgorithmAndDataStructure
Notifications	https://github.com/login?return_to=%2FPidunn%2FAlgorithmAndDataStructure
Fork 0	https://github.com/login?return_to=%2FPidunn%2FAlgorithmAndDataStructure
Star 0	https://github.com/login?return_to=%2FPidunn%2FAlgorithmAndDataStructure
0 stars	https://github.com/Pidunn/AlgorithmAndDataStructure/stargazers
77 forks	https://github.com/Pidunn/AlgorithmAndDataStructure/forks
Branches	https://github.com/Pidunn/AlgorithmAndDataStructure/branches
Tags	https://github.com/Pidunn/AlgorithmAndDataStructure/tags
Activity	https://github.com/Pidunn/AlgorithmAndDataStructure/activity
Star	https://github.com/login?return_to=%2FPidunn%2FAlgorithmAndDataStructure
Notifications	https://github.com/login?return_to=%2FPidunn%2FAlgorithmAndDataStructure
Code	https://github.com/Pidunn/AlgorithmAndDataStructure
Pull requests 0	https://github.com/Pidunn/AlgorithmAndDataStructure/pulls
Actions	https://github.com/Pidunn/AlgorithmAndDataStructure/actions
Projects 0	https://github.com/Pidunn/AlgorithmAndDataStructure/projects
Security 0	https://github.com/Pidunn/AlgorithmAndDataStructure/security
Insights	https://github.com/Pidunn/AlgorithmAndDataStructure/pulse
Code	https://github.com/Pidunn/AlgorithmAndDataStructure
Pull requests	https://github.com/Pidunn/AlgorithmAndDataStructure/pulls
Actions	https://github.com/Pidunn/AlgorithmAndDataStructure/actions
Projects	https://github.com/Pidunn/AlgorithmAndDataStructure/projects
Security	https://github.com/Pidunn/AlgorithmAndDataStructure/security
Insights	https://github.com/Pidunn/AlgorithmAndDataStructure/pulse
Branches	https://github.com/Pidunn/AlgorithmAndDataStructure/branches
Tags	https://github.com/Pidunn/AlgorithmAndDataStructure/tags
	https://github.com/Pidunn/AlgorithmAndDataStructure/branches
	https://github.com/Pidunn/AlgorithmAndDataStructure/tags
55 Commits	https://github.com/Pidunn/AlgorithmAndDataStructure/commits/master/
	https://github.com/Pidunn/AlgorithmAndDataStructure/commits/master/
LeetCode	https://github.com/Pidunn/AlgorithmAndDataStructure/tree/master/LeetCode
LeetCode	https://github.com/Pidunn/AlgorithmAndDataStructure/tree/master/LeetCode
SwordToOffer	https://github.com/Pidunn/AlgorithmAndDataStructure/tree/master/SwordToOffer
SwordToOffer	https://github.com/Pidunn/AlgorithmAndDataStructure/tree/master/SwordToOffer
.gitignore	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/.gitignore
.gitignore	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/.gitignore
README.md	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/README.md
README.md	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/README.md
doc-sample.md	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/doc-sample.md
doc-sample.md	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/doc-sample.md
update.sh	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/update.sh
update.sh	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/update.sh
README	https://github.com/Pidunn/AlgorithmAndDataStructure
另一个仓库	https://github.com/DmrfCoder/interview
	https://github.com/Pidunn/AlgorithmAndDataStructure#牛客网-剑指offer
二维数组中的查找	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.md
替换空格	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md
从尾到头打印链表	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md
重建二叉树	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md
用两个栈实现队列	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md
旋转数组的最小数字	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md
跳台阶	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E8%B7%B3%E5%8F%B0%E9%98%B6.md
变态跳台阶	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%8F%98%E6%80%81%E8%B7%B3%E5%8F%B0%E9%98%B6.md
矩形覆盖	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E7%9F%A9%E5%BD%A2%E8%A6%86%E7%9B%96.md
二进制中1的个数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0.md
数值的整数次方	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9.md
调整数组顺序使奇数位于偶数前面	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2.md
链表中倒数第k个节点	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md
反转链表	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md
合并两个排序的链表	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8.md
树的子结构	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84.md
树的镜像	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F.md
顺时针打印矩阵	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5.md
包含min函数的栈	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md
栈的压入&弹出顺序	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5&%E5%BC%B9%E5%87%BA%E9%A1%BA%E5%BA%8F.md
从上往下打印二叉树	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BB%8E%E4%B8%8A%E5%BE%80%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md
二叉搜索树的后序遍历	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%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.md
二叉树中和为某一数的路径	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E6%95%B0%E7%9A%84%E8%B7%AF%E5%BE%84.md
复杂链表的复制	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6.md
二叉搜索树与双向链表	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8.md
字符串的排列	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97.md
数组中出现次数超过一半的数字	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97.md
最小的K个数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%9C%80%E5%B0%8F%E7%9A%84K%E4%B8%AA%E6%95%B0.md
连续子数组的最大和	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C.md
把数组排成最小的数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md
整数中1出现的次数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md
丑数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%B8%91%E6%95%B0.md
第一次只出现一次的字符	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E7%AC%AC%E4%B8%80%E6%AC%A1%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.md
两个链表的第一个公共节点	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9.md
数字在排序数组中出现的次数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B0%E5%AD%97%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md
二叉树的深度	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6.md
平衡二叉树	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md
数组中只出现一次的数字	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B0%E7%BB%84%E4%B8%AD%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md
和为s的连续正数序列	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97.md
和为s的两个数字	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md
左旋字符串	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%B7%A6%E6%97%8B%E5%AD%97%E7%AC%A6%E4%B8%B2.md
翻转单词序列	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E5%BA%8F%E5%88%97.md
扑克牌顺子	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%89%91%E5%85%8B%E7%89%8C%E9%A1%BA%E5%AD%90.md
圆圈中的最后数字	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%9C%86%E5%9C%88%E4%B8%AD%E7%9A%84%E6%9C%80%E5%90%8E%E6%95%B0%E5%AD%97.md
不能用循环的1到n之和	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%B8%8D%E8%83%BD%E7%94%A8%E5%BE%AA%E7%8E%AF%E7%9A%841%E5%88%B0n%E4%B9%8B%E5%92%8C.md
不用加减乘除做加法	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%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.md
将字符串转为整数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%B0%86%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E4%B8%BA%E6%95%B4%E6%95%B0.md
寻找数组中任意一个重复的数字	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%AF%BB%E6%89%BE%E6%95%B0%E7%BB%84%E4%B8%AD%E4%BB%BB%E6%84%8F%E4%B8%80%E4%B8%AA%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md
构建乘积数组	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84.md
正则表达式匹配	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md
字符流中第一个不重复的字符	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%AD%97%E7%AC%A6%E6%B5%81%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E4%B8%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%97%E7%AC%A6.md
最大陆地问题	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%9C%80%E5%A4%A7%E9%99%86%E5%9C%B0%E9%97%AE%E9%A2%98.md
机器人的运动范围	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md
矩阵中的路径	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84.md
滑动窗口的最大值	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC.md
数据流的中位数	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B0%E6%8D%AE%E6%B5%81%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md
数组中的逆序对	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md
表示数值的字符串	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md
二叉搜索树的第k个节点	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9.md
序列化二叉树	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91.md
把二叉树打印成多行（层序遍历）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%A0%91%E6%89%93%E5%8D%B0%E6%88%90%E5%A4%9A%E8%A1%8C.md
按之字形打印二叉树	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E6%8C%89%E4%B9%8B%E5%AD%97%E5%BD%A2%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md
对称的二叉树	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md
二叉树的下一个节点	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E8%8A%82%E7%82%B9.md
删除有序链表中重复的节点	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E8%8A%82%E7%82%B9.md
链表中环的入口节点	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9.md
字符流中第一个不重复的字符	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E5%AD%97%E7%AC%A6%E6%B5%81%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E4%B8%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%97%E7%AC%A6.md
表示数字的字符串	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/SwordToOffer/Doc/%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%AD%97%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2.md
	https://github.com/Pidunn/AlgorithmAndDataStructure#leetcode
minimum-depth-of-binary-tree(求解二叉树的最小深度)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E5%B0%8F%E6%B7%B1%E5%BA%A6.md
evaluate-reverse-polish-notation(计算逆波兰式的值)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E8%AE%A1%E7%AE%97%E9%80%86%E6%B3%A2%E5%85%B0%E5%BC%8F%E7%9A%84%E5%80%BC.md
max-points-on-a-line(同一条直线上的最多的点的数量)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%90%8C%E4%B8%80%E6%9D%A1%E7%9B%B4%E7%BA%BF%E4%B8%8A%E7%9A%84%E6%9C%80%E5%A4%9A%E7%9A%84%E7%82%B9%E7%9A%84%E6%95%B0%E9%87%8F.md
sort-list(排序List)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E6%8E%92%E5%BA%8FList.md
insertion-sort-list(使用插入排序对链表进行排序)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E4%BD%BF%E7%94%A8%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F%E5%AF%B9%E9%93%BE%E8%A1%A8%E8%BF%9B%E8%A1%8C%E6%8E%92%E5%BA%8F.md
binary-tree-postorder-traversal（后序遍历二叉树）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E4%BA%8C%E5%8F%89%E6%A0%91.md
binary-tree-preorder-traversal（先序遍历二叉树）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%85%88%E5%BA%8F%E9%81%8D%E5%8E%86%E4%BA%8C%E5%8F%89%E6%A0%91.md
reorder-list（链表重排序）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E9%93%BE%E8%A1%A8%E9%87%8D%E6%8E%92%E5%BA%8F.md
linked-list-cycle-ii(找出链表中环的入口节点)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E6%89%BE%E5%87%BA%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E8%8A%82%E7%82%B9.md
linked-list-cycle(判断链表中是否存在环)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%88%A4%E6%96%AD%E9%93%BE%E8%A1%A8%E4%B8%AD%E6%98%AF%E5%90%A6%E5%AD%98%E5%9C%A8%E7%8E%AF.md
word-break（单词切分）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%8D%95%E8%AF%8D%E5%88%87%E5%88%86.md
word-break-ii（单词切分2）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%8D%95%E8%AF%8D%E5%88%87%E5%88%862.md
copy-list-with-random-pointer(拷贝具有随机指针的链表)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E6%8B%B7%E8%B4%9D%E5%85%B7%E6%9C%89%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88%E7%9A%84%E9%93%BE%E8%A1%A8.md
single-number(出现一次的数)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0.md
single-number-ii(出现一次的数2)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B02.md
candy（糖果问题）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E7%B3%96%E6%9E%9C%E9%97%AE%E9%A2%98.md
Gas-station（加油站问题)	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%8A%A0%E6%B2%B9%E7%AB%99%E9%97%AE%E9%A2%98.md
clone-graph（图的复制）	https://github.com/Pidunn/AlgorithmAndDataStructure/blob/master/LeetCode/Doc/%E5%9B%BE%E7%9A%84%E5%A4%8D%E5%88%B6.md
Readme	https://github.com/Pidunn/AlgorithmAndDataStructure#readme-ov-file
Please reload this page	https://github.com/Pidunn/AlgorithmAndDataStructure
Activity	https://github.com/Pidunn/AlgorithmAndDataStructure/activity
0 stars	https://github.com/Pidunn/AlgorithmAndDataStructure/stargazers
0 watching	https://github.com/Pidunn/AlgorithmAndDataStructure/watchers
0 forks	https://github.com/Pidunn/AlgorithmAndDataStructure/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FPidunn%2FAlgorithmAndDataStructure&report=Pidunn+%28user%29
Releases	https://github.com/Pidunn/AlgorithmAndDataStructure/releases
Packages 0	https://github.com/users/Pidunn/packages?repo_name=AlgorithmAndDataStructure
	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.