René's URL Explorer Experiment

Title: GitHub - infodept2015/coding_interviews: 《剑指Offer》题目汇总&常考题总结(Python实现) · GitHub

Open Graph Title: GitHub - infodept2015/coding_interviews: 《剑指Offer》题目汇总&常考题总结(Python实现)

X Title: GitHub - infodept2015/coding_interviews: 《剑指Offer》题目汇总&常考题总结(Python实现)

Description: 《剑指Offer》题目汇总&常考题总结(Python实现). Contribute to infodept2015/coding_interviews development by creating an account on GitHub.

Open Graph Description: 《剑指Offer》题目汇总&常考题总结(Python实现). Contribute to infodept2015/coding_interviews development by creating an account on GitHub.

X Description: 《剑指Offer》题目汇总&常考题总结(Python实现). Contribute to infodept2015/coding_interviews development by creating an account on GitHub.

Opengraph URL: https://github.com/infodept2015/coding_interviews

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:5cf3e90d-6040-4c31-34e7-b2db52bdf04e
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	E1A8:E2378:6993229:93D4243:6A4FBDFD
html-safe-nonce	66e8ed0763fb91469083d3bb0b2bbccad2022d6428f229792f73c35fa969cb29
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJFMUE4OkUyMzc4OjY5OTMyMjk6OTNENDI0Mzo2QTRGQkRGRCIsInZpc2l0b3JfaWQiOiI3NDY3NzMxMzU2NzAyNzE5NDg1IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac	9ee2df3af2d7f12666b953d1b3a081d17fa3c435fcb512ad0059a7df10562a24
hovercard-subject-tag	repository:233534728
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/infodept2015/coding_interviews
twitter:image	https://opengraph.githubassets.com/dc984ff900a2b2758f70e1bf1ddcd46a1a903ace7e60576330621e004906184c/infodept2015/coding_interviews
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/dc984ff900a2b2758f70e1bf1ddcd46a1a903ace7e60576330621e004906184c/infodept2015/coding_interviews
og:image:alt	《剑指Offer》题目汇总&常考题总结(Python实现). Contribute to infodept2015/coding_interviews 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	7d8f8209b188a80e19a6957836ab9229715797be5db1a04163963c674ccc33f6
turbo-cache-control	no-cache
go-import	github.com/infodept2015/coding_interviews git https://github.com/infodept2015/coding_interviews.git
octolytics-dimension-user_id	11515931
octolytics-dimension-user_login	infodept2015
octolytics-dimension-repository_id	233534728
octolytics-dimension-repository_nwo	infodept2015/coding_interviews
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	231751992
octolytics-dimension-repository_parent_nwo	shenweichen/coding_interviews
octolytics-dimension-repository_network_root_id	231751992
octolytics-dimension-repository_network_root_nwo	shenweichen/coding_interviews
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	ea848e83cf3bf3613dd7b13d52965a684fd23ec5
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/infodept2015/coding_interviews#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Finfodept2015%2Fcoding_interviews
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%2Finfodept2015%2Fcoding_interviews
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=infodept2015%2Fcoding_interviews
Reload	https://github.com/infodept2015/coding_interviews
Reload	https://github.com/infodept2015/coding_interviews
Reload	https://github.com/infodept2015/coding_interviews
infodept2015	https://github.com/infodept2015
coding_interviews	https://github.com/infodept2015/coding_interviews
shenweichen/coding_interviews	https://github.com/shenweichen/coding_interviews
Notifications	https://github.com/login?return_to=%2Finfodept2015%2Fcoding_interviews
Fork 0	https://github.com/login?return_to=%2Finfodept2015%2Fcoding_interviews
Star 0	https://github.com/login?return_to=%2Finfodept2015%2Fcoding_interviews
Code	https://github.com/infodept2015/coding_interviews
Pull requests 0	https://github.com/infodept2015/coding_interviews/pulls
Actions	https://github.com/infodept2015/coding_interviews/actions
Projects	https://github.com/infodept2015/coding_interviews/projects
Security and quality 0	https://github.com/infodept2015/coding_interviews/security
Insights	https://github.com/infodept2015/coding_interviews/pulse
Code	https://github.com/infodept2015/coding_interviews
Pull requests	https://github.com/infodept2015/coding_interviews/pulls
Actions	https://github.com/infodept2015/coding_interviews/actions
Projects	https://github.com/infodept2015/coding_interviews/projects
Security and quality	https://github.com/infodept2015/coding_interviews/security
Insights	https://github.com/infodept2015/coding_interviews/pulse
	https://github.com/infodept2015/coding_interviews
Branches	https://github.com/infodept2015/coding_interviews/branches
Tags	https://github.com/infodept2015/coding_interviews/tags
	https://github.com/infodept2015/coding_interviews/branches
	https://github.com/infodept2015/coding_interviews/tags
4 Commits	https://github.com/infodept2015/coding_interviews/commits/master/
	https://github.com/infodept2015/coding_interviews/commits/master/
10.变态跳台阶	https://github.com/infodept2015/coding_interviews/tree/master/10.%E5%8F%98%E6%80%81%E8%B7%B3%E5%8F%B0%E9%98%B6
10.变态跳台阶	https://github.com/infodept2015/coding_interviews/tree/master/10.%E5%8F%98%E6%80%81%E8%B7%B3%E5%8F%B0%E9%98%B6
10.斐波那契数列	https://github.com/infodept2015/coding_interviews/tree/master/10.%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97
10.斐波那契数列	https://github.com/infodept2015/coding_interviews/tree/master/10.%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97
10.矩形覆盖	https://github.com/infodept2015/coding_interviews/tree/master/10.%E7%9F%A9%E5%BD%A2%E8%A6%86%E7%9B%96
10.矩形覆盖	https://github.com/infodept2015/coding_interviews/tree/master/10.%E7%9F%A9%E5%BD%A2%E8%A6%86%E7%9B%96
10.跳台阶	https://github.com/infodept2015/coding_interviews/tree/master/10.%E8%B7%B3%E5%8F%B0%E9%98%B6
10.跳台阶	https://github.com/infodept2015/coding_interviews/tree/master/10.%E8%B7%B3%E5%8F%B0%E9%98%B6
11.旋转数组的最小数字	https://github.com/infodept2015/coding_interviews/tree/master/11.%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
11.旋转数组的最小数字	https://github.com/infodept2015/coding_interviews/tree/master/11.%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
12.矩阵中的路径	https://github.com/infodept2015/coding_interviews/tree/master/12.%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84
12.矩阵中的路径	https://github.com/infodept2015/coding_interviews/tree/master/12.%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84
13.机器人的运动范围	https://github.com/infodept2015/coding_interviews/tree/master/13.%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4
13.机器人的运动范围	https://github.com/infodept2015/coding_interviews/tree/master/13.%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4
15.二进制中的1的个数	https://github.com/infodept2015/coding_interviews/tree/master/15.%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD%E7%9A%841%E7%9A%84%E4%B8%AA%E6%95%B0
15.二进制中的1的个数	https://github.com/infodept2015/coding_interviews/tree/master/15.%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD%E7%9A%841%E7%9A%84%E4%B8%AA%E6%95%B0
16.数值的整数次方	https://github.com/infodept2015/coding_interviews/tree/master/16.%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9
16.数值的整数次方	https://github.com/infodept2015/coding_interviews/tree/master/16.%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9
18.删除链表中重复结点	https://github.com/infodept2015/coding_interviews/tree/master/18.%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%BB%93%E7%82%B9
18.删除链表中重复结点	https://github.com/infodept2015/coding_interviews/tree/master/18.%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%BB%93%E7%82%B9
21.调整数组顺序使奇数位于偶数前面	https://github.com/infodept2015/coding_interviews/tree/master/21.%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
21.调整数组顺序使奇数位于偶数前面	https://github.com/infodept2015/coding_interviews/tree/master/21.%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
22.链表中倒数第k个结点	https://github.com/infodept2015/coding_interviews/tree/master/22.%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E7%BB%93%E7%82%B9
22.链表中倒数第k个结点	https://github.com/infodept2015/coding_interviews/tree/master/22.%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E7%BB%93%E7%82%B9
23.链表中环的入口结点	https://github.com/infodept2015/coding_interviews/tree/master/23.%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E7%BB%93%E7%82%B9
23.链表中环的入口结点	https://github.com/infodept2015/coding_interviews/tree/master/23.%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%8E%AF%E7%9A%84%E5%85%A5%E5%8F%A3%E7%BB%93%E7%82%B9
24.反转链表	https://github.com/infodept2015/coding_interviews/tree/master/24.%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8
24.反转链表	https://github.com/infodept2015/coding_interviews/tree/master/24.%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8
25.合并两个排序的链表	https://github.com/infodept2015/coding_interviews/tree/master/25.%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
25.合并两个排序的链表	https://github.com/infodept2015/coding_interviews/tree/master/25.%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
26.树的子结构	https://github.com/infodept2015/coding_interviews/tree/master/26.%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84
26.树的子结构	https://github.com/infodept2015/coding_interviews/tree/master/26.%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84
27.二叉树的镜像	https://github.com/infodept2015/coding_interviews/tree/master/27.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F
27.二叉树的镜像	https://github.com/infodept2015/coding_interviews/tree/master/27.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F
28.对称的二叉树	https://github.com/infodept2015/coding_interviews/tree/master/28.%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91
28.对称的二叉树	https://github.com/infodept2015/coding_interviews/tree/master/28.%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91
29.顺时针打印矩阵	https://github.com/infodept2015/coding_interviews/tree/master/29.%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5
29.顺时针打印矩阵	https://github.com/infodept2015/coding_interviews/tree/master/29.%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5
3.数组中重复的数字	https://github.com/infodept2015/coding_interviews/tree/master/3.%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97
3.数组中重复的数字	https://github.com/infodept2015/coding_interviews/tree/master/3.%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97
30.包含min函数的栈	https://github.com/infodept2015/coding_interviews/tree/master/30.%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88
30.包含min函数的栈	https://github.com/infodept2015/coding_interviews/tree/master/30.%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88
31.栈的压入弹出序列	https://github.com/infodept2015/coding_interviews/tree/master/31.%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97
31.栈的压入弹出序列	https://github.com/infodept2015/coding_interviews/tree/master/31.%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97
32.从上往下打印二叉树	https://github.com/infodept2015/coding_interviews/tree/master/32.%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
32.从上往下打印二叉树	https://github.com/infodept2015/coding_interviews/tree/master/32.%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
32.把二叉树打印成多行	https://github.com/infodept2015/coding_interviews/tree/master/32.%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
32.把二叉树打印成多行	https://github.com/infodept2015/coding_interviews/tree/master/32.%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
32.按之字形顺序打印二叉树	https://github.com/infodept2015/coding_interviews/tree/master/32.%E6%8C%89%E4%B9%8B%E5%AD%97%E5%BD%A2%E9%A1%BA%E5%BA%8F%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91
32.按之字形顺序打印二叉树	https://github.com/infodept2015/coding_interviews/tree/master/32.%E6%8C%89%E4%B9%8B%E5%AD%97%E5%BD%A2%E9%A1%BA%E5%BA%8F%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91
33.二叉搜索树的后序遍历序列	https://github.com/infodept2015/coding_interviews/tree/master/33.%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
33.二叉搜索树的后序遍历序列	https://github.com/infodept2015/coding_interviews/tree/master/33.%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
34.二叉树中和为某一值的路径	https://github.com/infodept2015/coding_interviews/tree/master/34.%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84
34.二叉树中和为某一值的路径	https://github.com/infodept2015/coding_interviews/tree/master/34.%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84
35.复杂链表的复制	https://github.com/infodept2015/coding_interviews/tree/master/35.%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6
35.复杂链表的复制	https://github.com/infodept2015/coding_interviews/tree/master/35.%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6
36.二叉搜索树与双向链表	https://github.com/infodept2015/coding_interviews/tree/master/36.%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
36.二叉搜索树与双向链表	https://github.com/infodept2015/coding_interviews/tree/master/36.%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
37.序列化二叉树	https://github.com/infodept2015/coding_interviews/tree/master/37.%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91
37.序列化二叉树	https://github.com/infodept2015/coding_interviews/tree/master/37.%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91
38.字符串的排列	https://github.com/infodept2015/coding_interviews/tree/master/38.%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97
38.字符串的排列	https://github.com/infodept2015/coding_interviews/tree/master/38.%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97
39.数组中出现次数超过一半的数字	https://github.com/infodept2015/coding_interviews/tree/master/39.%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
39.数组中出现次数超过一半的数字	https://github.com/infodept2015/coding_interviews/tree/master/39.%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
4.二维数组中的查找	https://github.com/infodept2015/coding_interviews/tree/master/4.%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE
4.二维数组中的查找	https://github.com/infodept2015/coding_interviews/tree/master/4.%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE
40.最小的k个数	https://github.com/infodept2015/coding_interviews/tree/master/40.%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0
40.最小的k个数	https://github.com/infodept2015/coding_interviews/tree/master/40.%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0
41.数据流中的中位数	https://github.com/infodept2015/coding_interviews/tree/master/41.%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0
41.数据流中的中位数	https://github.com/infodept2015/coding_interviews/tree/master/41.%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0
42.连续子数组的最大和	https://github.com/infodept2015/coding_interviews/tree/master/42.%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
42.连续子数组的最大和	https://github.com/infodept2015/coding_interviews/tree/master/42.%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
43.整数中1出现的次数	https://github.com/infodept2015/coding_interviews/tree/master/43.%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0
43.整数中1出现的次数	https://github.com/infodept2015/coding_interviews/tree/master/43.%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0
45.把数组排成最小的数	https://github.com/infodept2015/coding_interviews/tree/master/45.%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
45.把数组排成最小的数	https://github.com/infodept2015/coding_interviews/tree/master/45.%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
49.丑数	https://github.com/infodept2015/coding_interviews/tree/master/49.%E4%B8%91%E6%95%B0
49.丑数	https://github.com/infodept2015/coding_interviews/tree/master/49.%E4%B8%91%E6%95%B0
5.替换空格	https://github.com/infodept2015/coding_interviews/tree/master/5.%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC
5.替换空格	https://github.com/infodept2015/coding_interviews/tree/master/5.%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC
50.字符流中第一个不重复的字符	https://github.com/infodept2015/coding_interviews/tree/master/50.%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
50.字符流中第一个不重复的字符	https://github.com/infodept2015/coding_interviews/tree/master/50.%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
50.第一个只出现一次的字符	https://github.com/infodept2015/coding_interviews/tree/master/50.%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6
50.第一个只出现一次的字符	https://github.com/infodept2015/coding_interviews/tree/master/50.%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6
51.数组中的逆序对	https://github.com/infodept2015/coding_interviews/tree/master/51.%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9
51.数组中的逆序对	https://github.com/infodept2015/coding_interviews/tree/master/51.%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9
52.两个链表的第一个公共结点	https://github.com/infodept2015/coding_interviews/tree/master/52.%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%E7%BB%93%E7%82%B9
52.两个链表的第一个公共结点	https://github.com/infodept2015/coding_interviews/tree/master/52.%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%E7%BB%93%E7%82%B9
53.数字在排序数组中出现的次数	https://github.com/infodept2015/coding_interviews/tree/master/53.%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
53.数字在排序数组中出现的次数	https://github.com/infodept2015/coding_interviews/tree/master/53.%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
54.二叉搜索树的第k个结点	https://github.com/infodept2015/coding_interviews/tree/master/54.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E4%B8%AA%E7%BB%93%E7%82%B9
54.二叉搜索树的第k个结点	https://github.com/infodept2015/coding_interviews/tree/master/54.%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E4%B8%AA%E7%BB%93%E7%82%B9
55.二叉树的深度	https://github.com/infodept2015/coding_interviews/tree/master/55.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6
55.二叉树的深度	https://github.com/infodept2015/coding_interviews/tree/master/55.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6
55.平衡二叉树	https://github.com/infodept2015/coding_interviews/tree/master/55.%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91
55.平衡二叉树	https://github.com/infodept2015/coding_interviews/tree/master/55.%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91
56.数组中只出现一次的数字	https://github.com/infodept2015/coding_interviews/tree/master/56.%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
56.数组中只出现一次的数字	https://github.com/infodept2015/coding_interviews/tree/master/56.%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
57.和为S的两个数字	https://github.com/infodept2015/coding_interviews/tree/master/57.%E5%92%8C%E4%B8%BAS%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97
57.和为S的两个数字	https://github.com/infodept2015/coding_interviews/tree/master/57.%E5%92%8C%E4%B8%BAS%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97
57.和为S的连续正数序列	https://github.com/infodept2015/coding_interviews/tree/master/57.%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
57.和为S的连续正数序列	https://github.com/infodept2015/coding_interviews/tree/master/57.%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
58.左旋转字符串	https://github.com/infodept2015/coding_interviews/tree/master/58.%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2
58.左旋转字符串	https://github.com/infodept2015/coding_interviews/tree/master/58.%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2
58.翻转单词序列	https://github.com/infodept2015/coding_interviews/tree/master/58.%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E5%BA%8F%E5%88%97
58.翻转单词序列	https://github.com/infodept2015/coding_interviews/tree/master/58.%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E5%BA%8F%E5%88%97
59.滑动窗口的最大值	https://github.com/infodept2015/coding_interviews/tree/master/59.%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC
59.滑动窗口的最大值	https://github.com/infodept2015/coding_interviews/tree/master/59.%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC
6.从尾到头打印链表	https://github.com/infodept2015/coding_interviews/tree/master/6.%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8
6.从尾到头打印链表	https://github.com/infodept2015/coding_interviews/tree/master/6.%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8
61.扑克牌顺子	https://github.com/infodept2015/coding_interviews/tree/master/61.%E6%89%91%E5%85%8B%E7%89%8C%E9%A1%BA%E5%AD%90
61.扑克牌顺子	https://github.com/infodept2015/coding_interviews/tree/master/61.%E6%89%91%E5%85%8B%E7%89%8C%E9%A1%BA%E5%AD%90
62.孩子们的游戏(圆圈中最后剩下的数)	https://github.com/infodept2015/coding_interviews/tree/master/62.%E5%AD%A9%E5%AD%90%E4%BB%AC%E7%9A%84%E6%B8%B8%E6%88%8F(%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0)
62.孩子们的游戏(圆圈中最后剩下的数)	https://github.com/infodept2015/coding_interviews/tree/master/62.%E5%AD%A9%E5%AD%90%E4%BB%AC%E7%9A%84%E6%B8%B8%E6%88%8F(%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0)
65.不用加减乘除做加法	https://github.com/infodept2015/coding_interviews/tree/master/65.%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
65.不用加减乘除做加法	https://github.com/infodept2015/coding_interviews/tree/master/65.%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
66.构建乘积数组	https://github.com/infodept2015/coding_interviews/tree/master/66.%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84
66.构建乘积数组	https://github.com/infodept2015/coding_interviews/tree/master/66.%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84
67.把字符串转换成整数	https://github.com/infodept2015/coding_interviews/tree/master/67.%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0
67.把字符串转换成整数	https://github.com/infodept2015/coding_interviews/tree/master/67.%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0
7.重建二叉树	https://github.com/infodept2015/coding_interviews/tree/master/7.%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91
7.重建二叉树	https://github.com/infodept2015/coding_interviews/tree/master/7.%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91
8.二叉树的下一个结点	https://github.com/infodept2015/coding_interviews/tree/master/8.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E7%BB%93%E7%82%B9
8.二叉树的下一个结点	https://github.com/infodept2015/coding_interviews/tree/master/8.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%8B%E4%B8%80%E4%B8%AA%E7%BB%93%E7%82%B9
9.用两个栈实现队列	https://github.com/infodept2015/coding_interviews/tree/master/9.%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97
9.用两个栈实现队列	https://github.com/infodept2015/coding_interviews/tree/master/9.%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97
.gitattributes	https://github.com/infodept2015/coding_interviews/blob/master/.gitattributes
.gitattributes	https://github.com/infodept2015/coding_interviews/blob/master/.gitattributes
.gitignore	https://github.com/infodept2015/coding_interviews/blob/master/.gitignore
.gitignore	https://github.com/infodept2015/coding_interviews/blob/master/.gitignore
LICENSE	https://github.com/infodept2015/coding_interviews/blob/master/LICENSE
LICENSE	https://github.com/infodept2015/coding_interviews/blob/master/LICENSE
README.md	https://github.com/infodept2015/coding_interviews/blob/master/README.md
README.md	https://github.com/infodept2015/coding_interviews/blob/master/README.md
README	https://github.com/infodept2015/coding_interviews
MIT license	https://github.com/infodept2015/coding_interviews
	https://github.com/infodept2015/coding_interviews#剑指offer题目汇总
https://www.nowcoder.com/ta/coding-interviews	https://www.nowcoder.com/ta/coding-interviews
Readme	https://github.com/infodept2015/coding_interviews#readme-ov-file
MIT license	https://github.com/infodept2015/coding_interviews#MIT-1-ov-file
Please reload this page	https://github.com/infodept2015/coding_interviews
Activity	https://github.com/infodept2015/coding_interviews/activity
0 forks	https://github.com/infodept2015/coding_interviews/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Finfodept2015%2Fcoding_interviews&report=infodept2015+%28user%29
Releases	https://github.com/infodept2015/coding_interviews/releases
Packages 0	https://github.com/users/infodept2015/packages?repo_name=coding_interviews
Please reload this page	https://github.com/infodept2015/coding_interviews
Contributors	https://github.com/infodept2015/coding_interviews/graphs/contributors
Please reload this page	https://github.com/infodept2015/coding_interviews
	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.