René's URL Explorer Experiment


Title: leetcode_/lcof at main · afeesps/leetcode_ · GitHub

Open Graph Title: leetcode_/lcof at main · afeesps/leetcode_

X Title: leetcode_/lcof at main · afeesps/leetcode_

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

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

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

Opengraph URL: https://github.com/afeesps/leetcode_/tree/main/lcof

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository/tree/*name(/*path)
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:ab5db4d8-7063-ec95-cc4d-85a04c2f91bc
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id9310:28BCC0:2EADEA0:3E25E1B:6A652762
html-safe-nonce5fc3ebb81bca25acfbe28c60658ee3698122c7fe78a22064630b5dd1bb9d97eb
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5MzEwOjI4QkNDMDoyRUFERUEwOjNFMjVFMUI6NkE2NTI3NjIiLCJ2aXNpdG9yX2lkIjoiMjg3NzE3MzIyNjE4MzgyMTc4IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmacd27f54bfd389eb510558b21aede5c5f8bc3b8b43ee542e76a17552c5428648f4
hovercard-subject-tagrepository:1240929001
github-keyboard-shortcutsrepository,source-code,file-tree,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location///files/disambiguate
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/afeesps/leetcode_/tree/main/lcof
twitter:imagehttps://opengraph.githubassets.com/40f4f58d263e03c073c61fa2bec4356521ce4936eef1aae0e39a12569fa396d4/afeesps/leetcode_
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/40f4f58d263e03c073c61fa2bec4356521ce4936eef1aae0e39a12569fa396d4/afeesps/leetcode_
og:image:alt🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - afeesps/leetcode_
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None52c76df668885aaff23b50bdca1fa1ea44ac9c1553e888ebc70ff1e4daa4625b
turbo-cache-controlno-cache
go-importgithub.com/afeesps/leetcode_ git https://github.com/afeesps/leetcode_.git
octolytics-dimension-user_id8069377
octolytics-dimension-user_loginafeesps
octolytics-dimension-repository_id1240929001
octolytics-dimension-repository_nwoafeesps/leetcode_
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id149001365
octolytics-dimension-repository_parent_nwodoocs/leetcode
octolytics-dimension-repository_network_root_id149001365
octolytics-dimension-repository_network_root_nwodoocs/leetcode
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release309153364422b3c499922d1a2a6404910a58ed8e
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/afeesps/leetcode_/tree/main/lcof#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fafeesps%2Fleetcode_%2Ftree%2Fmain%2Flcof
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub Copilot appDirect agents from issue to mergehttps://github.com/features/ai/github-app
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
Code QualityEnforce quality at mergehttps://github.com/features/code-quality
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
View all resourceshttps://github.com/resources
GitHub SponsorsFund open source developershttps://github.com/open-source/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/open-source/accelerator
GitHub Starshttps://stars.github.com
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/enterprise/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fafeesps%2Fleetcode_%2Ftree%2Fmain%2Flcof
Sign up https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E%2Ffiles%2Fdisambiguate&source=header-repo&source_repo=afeesps%2Fleetcode_
Reloadhttps://github.com/afeesps/leetcode_/tree/main/lcof
Reloadhttps://github.com/afeesps/leetcode_/tree/main/lcof
Reloadhttps://github.com/afeesps/leetcode_/tree/main/lcof
afeesps https://github.com/afeesps
leetcode_https://github.com/afeesps/leetcode_
doocs/leetcodehttps://github.com/doocs/leetcode
Notifications https://github.com/login?return_to=%2Fafeesps%2Fleetcode_
Fork 0 https://github.com/login?return_to=%2Fafeesps%2Fleetcode_
Star 0 https://github.com/login?return_to=%2Fafeesps%2Fleetcode_
Code https://github.com/afeesps/leetcode_
Pull requests 0 https://github.com/afeesps/leetcode_/pulls
Actions https://github.com/afeesps/leetcode_/actions
Projects https://github.com/afeesps/leetcode_/projects
Security and quality 0 https://github.com/afeesps/leetcode_/security
Insights https://github.com/afeesps/leetcode_/pulse
Code https://github.com/afeesps/leetcode_
Pull requests https://github.com/afeesps/leetcode_/pulls
Actions https://github.com/afeesps/leetcode_/actions
Projects https://github.com/afeesps/leetcode_/projects
Security and quality https://github.com/afeesps/leetcode_/security
Insights https://github.com/afeesps/leetcode_/pulse
https://github.com/afeesps/leetcode_
leetcode_https://github.com/afeesps/leetcode_/tree/main
Historyhttps://github.com/afeesps/leetcode_/commits/main/lcof
https://github.com/afeesps/leetcode_/commits/main/lcof
leetcode_https://github.com/afeesps/leetcode_/tree/main
..https://github.com/afeesps/leetcode_/tree/main
面试题03. 数组中重复的数字https://github.com/afeesps/leetcode_/tree/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
面试题03. 数组中重复的数字https://github.com/afeesps/leetcode_/tree/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
面试题04. 二维数组中的查找https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE
面试题04. 二维数组中的查找https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE
面试题05. 替换空格https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9805.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC
面试题05. 替换空格https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9805.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC
面试题06. 从尾到头打印链表https://github.com/afeesps/leetcode_/tree/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
面试题06. 从尾到头打印链表https://github.com/afeesps/leetcode_/tree/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
面试题07. 重建二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9807.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91
面试题07. 重建二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9807.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91
面试题09. 用两个栈实现队列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9809.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97
面试题09. 用两个栈实现队列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9809.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97
面试题10- I. 斐波那契数列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97
面试题10- I. 斐波那契数列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97
面试题10- II. 青蛙跳台阶问题https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98
面试题10- II. 青蛙跳台阶问题https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98
面试题11. 旋转数组的最小数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9811.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9811.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9812.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84
面试题12. 矩阵中的路径https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9812.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84
面试题13. 机器人的运动范围https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9813.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9813.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4
面试题14- I. 剪绳子https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90
面试题14- I. 剪绳子https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90
面试题14- II. 剪绳子 IIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II
面试题14- II. 剪绳子 IIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II
面试题15. 二进制中1的个数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9815.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0
面试题15. 二进制中1的个数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9815.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0
面试题16. 数值的整数次方https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9816.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9816.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9
面试题17. 打印从1到最大的n位数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0
面试题17. 打印从1到最大的n位数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0
面试题18. 删除链表的节点https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9818.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9
面试题18. 删除链表的节点https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9818.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9
面试题19. 正则表达式匹配https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9819.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D
面试题19. 正则表达式匹配https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9819.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D
面试题20. 表示数值的字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9820.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题20. 表示数值的字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9820.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题21. 调整数组顺序使奇数位于偶数前面https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9822.%20%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
面试题22. 链表中倒数第k个节点https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9822.%20%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
面试题24. 反转链表https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8
面试题24. 反转链表https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8
面试题25. 合并两个排序的链表https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%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/afeesps/leetcode_/tree/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
面试题26. 树的子结构https://github.com/afeesps/leetcode_/tree/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
面试题27. 二叉树的镜像https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9827.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F
面试题27. 二叉树的镜像https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9827.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F
面试题28. 对称的二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9828.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91
面试题28. 对称的二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9828.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91
面试题29. 顺时针打印矩阵https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9829.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9829.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5
面试题30. 包含min函数的栈https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9830.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88
面试题30. 包含min函数的栈https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9830.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88
面试题31. 栈的压入、弹出序列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9831.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97
面试题31. 栈的压入、弹出序列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9831.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97
面试题32 - I. 从上到下打印二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91
面试题32 - I. 从上到下打印二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91
面试题32 - II. 从上到下打印二叉树 IIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II
面试题32 - II. 从上到下打印二叉树 IIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II
面试题32 - III. 从上到下打印二叉树 IIIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III
面试题32 - III. 从上到下打印二叉树 IIIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III
面试题33. 二叉搜索树的后序遍历序列https://github.com/afeesps/leetcode_/tree/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
面试题33. 二叉搜索树的后序遍历序列https://github.com/afeesps/leetcode_/tree/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
面试题34. 二叉树中和为某一值的路径https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9834.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9834.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9835.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9835.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9836.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9836.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9837.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91
面试题37. 序列化二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9837.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91
面试题38. 字符串的排列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9838.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97
面试题38. 字符串的排列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9838.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97
面试题39. 数组中出现次数超过一半的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9839.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9839.%20%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
面试题40. 最小的k个数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9840.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0
面试题40. 最小的k个数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9840.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0
面试题41. 数据流中的中位数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9841.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9841.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9842.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9842.%20%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～n整数中1出现的次数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9843.%201%EF%BD%9En%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～n整数中1出现的次数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9843.%201%EF%BD%9En%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0
面试题44. 数字序列中某一位的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9844.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97
面试题44. 数字序列中某一位的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9844.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97
面试题45. 把数组排成最小的数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9845.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9845.%20%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
面试题46. 把数字翻译成字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9846.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题46. 把数字翻译成字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9846.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题47. 礼物的最大价值https://github.com/afeesps/leetcode_/tree/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
面试题47. 礼物的最大价值https://github.com/afeesps/leetcode_/tree/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
面试题48. 最长不含重复字符的子字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9848.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题48. 最长不含重复字符的子字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9848.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题49. 丑数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9849.%20%E4%B8%91%E6%95%B0
面试题49. 丑数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9849.%20%E4%B8%91%E6%95%B0
面试题50. 第一个只出现一次的字符https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9850.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9850.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9851.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9851.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9852.%20%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
面试题52. 两个链表的第一个公共节点https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9852.%20%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
面试题53 - I. 在排序数组中查找数字 Ihttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I
面试题53 - I. 在排序数组中查找数字 Ihttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I
面试题53 - II. 0～n-1中缺失的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97
面试题53 - II. 0～n-1中缺失的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97
面试题54. 二叉搜索树的第k大节点https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9854.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9
面试题54. 二叉搜索树的第k大节点https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9854.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9
面试题55 - I. 二叉树的深度https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6
面试题55 - I. 二叉树的深度https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6
面试题55 - II. 平衡二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91
面试题55 - II. 平衡二叉树https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91
面试题56 - I. 数组中数字出现的次数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0
面试题56 - I. 数组中数字出现的次数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0
面试题56 - II. 数组中数字出现的次数 IIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II
面试题56 - II. 数组中数字出现的次数 IIhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II
面试题57 - II. 和为s的连续正数序列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857%20-%20II.%20%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 - II. 和为s的连续正数序列https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857%20-%20II.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97
面试题58 - I. 翻转单词顺序https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F
面试题58 - I. 翻转单词顺序https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F
面试题58 - II. 左旋转字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题58 - II. 左旋转字符串https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2
面试题59 - I. 滑动窗口的最大值https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20I.%20%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 - I. 滑动窗口的最大值https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20I.%20%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 - II. 队列的最大值https://github.com/afeesps/leetcode_/tree/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
面试题59 - II. 队列的最大值https://github.com/afeesps/leetcode_/tree/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
面试题60. n个骰子的点数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9860.%20n%E4%B8%AA%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0
面试题60. n个骰子的点数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9860.%20n%E4%B8%AA%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0
面试题61. 扑克牌中的顺子https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9861.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90
面试题61. 扑克牌中的顺子https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9861.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90
面试题62. 圆圈中最后剩下的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9862.%20%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%E5%AD%97
面试题62. 圆圈中最后剩下的数字https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9862.%20%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%E5%AD%97
面试题63. 股票的最大利润https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9863.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6
面试题63. 股票的最大利润https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9863.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6
面试题64. 求1+2+…+nhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn
面试题64. 求1+2+…+nhttps://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn
面试题65. 不用加减乘除做加法https://github.com/afeesps/leetcode_/tree/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
面试题65. 不用加减乘除做加法https://github.com/afeesps/leetcode_/tree/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
面试题66. 构建乘积数组https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9866.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84
面试题66. 构建乘积数组https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9866.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84
面试题67. 把字符串转换成整数https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9867.%20%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/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9867.%20%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
面试题68 - I. 二叉搜索树的最近公共祖先https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88
面试题68 - I. 二叉搜索树的最近公共祖先https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88
面试题68 - II. 二叉树的最近公共祖先https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88
面试题68 - II. 二叉树的最近公共祖先https://github.com/afeesps/leetcode_/tree/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88
README.mdhttps://github.com/afeesps/leetcode_/blob/main/lcof/README.md
README.mdhttps://github.com/afeesps/leetcode_/blob/main/lcof/README.md
README_EN.mdhttps://github.com/afeesps/leetcode_/blob/main/lcof/README_EN.md
README_EN.mdhttps://github.com/afeesps/leetcode_/blob/main/lcof/README_EN.md
lcof.jsonhttps://github.com/afeesps/leetcode_/blob/main/lcof/lcof.json
lcof.jsonhttps://github.com/afeesps/leetcode_/blob/main/lcof/lcof.json
lcof.pnghttps://github.com/afeesps/leetcode_/blob/main/lcof/lcof.png
lcof.pnghttps://github.com/afeesps/leetcode_/blob/main/lcof/lcof.png
lcof_list.jsonhttps://github.com/afeesps/leetcode_/blob/main/lcof/lcof_list.json
lcof_list.jsonhttps://github.com/afeesps/leetcode_/blob/main/lcof/lcof_list.json
README.mdhttps://github.com/afeesps/leetcode_/tree/main/lcof#readme
https://github.com/doocs/leetcode/edit/main/lcof/README.mdhttps://github.com/doocs/leetcode/edit/main/lcof/README.md
https://github.com/afeesps/leetcode_/tree/main/lcof#剑指-offer第-2-版系列
https://github.com/afeesps/leetcode_/blob/main/lcof/lcof.png
English Versionhttps://github.com/afeesps/leetcode_/blob/main/lcof/README_EN.md
https://github.com/afeesps/leetcode_/tree/main/lcof#题解
开源社区 Doocshttps://github.com/doocs
03https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof
数组中重复的数字https://github.com/afeesps/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
04https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof
二维数组中的查找https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/README.md
05https://leetcode.cn/problems/ti-huan-kong-ge-lcof
替换空格https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9805.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC/README.md
06https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof
从尾到头打印链表https://github.com/afeesps/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
07https://leetcode.cn/problems/zhong-jian-er-cha-shu-lcof
重建二叉树https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9807.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91/README.md
09https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof
用两个栈实现队列https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9809.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97/README.md
10- Ihttps://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof
斐波那契数列https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97/README.md
10- IIhttps://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof
青蛙跳台阶问题https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98/README.md
11https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof
旋转数组的最小数字https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9811.%20%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/README.md
12https://leetcode.cn/problems/ju-zhen-zhong-de-lu-jing-lcof
矩阵中的路径https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9812.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84/README.md
13https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof
机器人的运动范围https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9813.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4/README.md
14- Ihttps://leetcode.cn/problems/jian-sheng-zi-lcof
剪绳子https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90/README.md
14- IIhttps://leetcode.cn/problems/jian-sheng-zi-ii-lcof
剪绳子 IIhttps://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II/README.md
15https://leetcode.cn/problems/er-jin-zhi-zhong-1de-ge-shu-lcof
二进制中 1 的个数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9815.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0/README.md
16https://leetcode.cn/problems/shu-zhi-de-zheng-shu-ci-fang-lcof
数值的整数次方https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9816.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9/README.md
17https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof
打印从 1 到最大的 n 位数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0/README.md
18https://leetcode.cn/problems/shan-chu-lian-biao-de-jie-dian-lcof
删除链表的节点https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9818.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9/README.md
19https://leetcode.cn/problems/zheng-ze-biao-da-shi-pi-pei-lcof
正则表达式匹配https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9819.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D/README.md
20https://leetcode.cn/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof
表示数值的字符串https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9820.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md
21https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof
调整数组顺序使奇数位于偶数前面https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%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/README.md
22https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof
链表中倒数第 k 个节点https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9822.%20%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/README.md
24https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof
反转链表https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/README.md
25https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof
合并两个排序的链表https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%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/README.md
26https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof
树的子结构https://github.com/afeesps/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
27https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof
二叉树的镜像https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9827.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F/README.md
28https://leetcode.cn/problems/dui-cheng-de-er-cha-shu-lcof
对称的二叉树https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9828.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91/README.md
29https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof
顺时针打印矩阵https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9829.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5/README.md
30https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof
包含 min 函数的栈https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9830.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88/README.md
31https://leetcode.cn/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof
栈的压入、弹出序列https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9831.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/README.md
32 - Ihttps://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof
从上到下打印二叉树https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/README.md
32 - IIhttps://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof
从上到下打印二叉树 IIhttps://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II/README.md
32 - IIIhttps://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof
从上到下打印二叉树 IIIhttps://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/README.md
33https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof
二叉搜索树的后序遍历序列https://github.com/afeesps/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
34https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof
二叉树中和为某一值的路径https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9834.%20%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/README.md
35https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof
复杂链表的复制https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9835.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6/README.md
36https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof
二叉搜索树与双向链表https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9836.%20%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/README.md
37https://leetcode.cn/problems/xu-lie-hua-er-cha-shu-lcof
序列化二叉树https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9837.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91/README.md
38https://leetcode.cn/problems/zi-fu-chuan-de-pai-lie-lcof
字符串的排列https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9838.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97/README.md
39https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof
数组中出现次数超过一半的数字https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9839.%20%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/README.md
40https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof
最小的 k 个数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9840.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0/README.md
41https://leetcode.cn/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof
数据流中的中位数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9841.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0/README.md
42https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof
连续子数组的最大和https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9842.%20%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/README.md
43https://leetcode.cn/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof
1 ～ n 整数中 1 出现的次数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9843.%201%EF%BD%9En%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md
44https://leetcode.cn/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof
数字序列中某一位的数字https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9844.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md
45https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof
把数组排成最小的数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9845.%20%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/README.md
46https://leetcode.cn/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof
把数字翻译成字符串https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9846.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md
47https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof
礼物的最大价值https://github.com/afeesps/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
48https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof
最长不含重复字符的子字符串https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9848.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md
49https://leetcode.cn/problems/chou-shu-lcof
丑数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9849.%20%E4%B8%91%E6%95%B0/README.md
50https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof
第一个只出现一次的字符https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9850.%20%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/README.md
51https://leetcode.cn/problems/shu-zu-zhong-de-ni-xu-dui-lcof
数组中的逆序对https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9851.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9/README.md
52https://leetcode.cn/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof
两个链表的第一个公共节点https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9852.%20%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/README.md
53 - Ihttps://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
在排序数组中查找数字 Ihttps://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I/README.md
53 - IIhttps://leetcode.cn/problems/que-shi-de-shu-zi-lcof
0 ～ n-1 中缺失的数字https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97/README.md
54https://leetcode.cn/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof
二叉搜索树的第 k 大节点https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9854.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9/README.md
55 - Ihttps://leetcode.cn/problems/er-cha-shu-de-shen-du-lcof
二叉树的深度https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6/README.md
55 - IIhttps://leetcode.cn/problems/ping-heng-er-cha-shu-lcof
平衡二叉树https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91/README.md
56 - Ihttps://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof
数组中数字出现的次数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md
56 - IIhttps://leetcode.cn/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof
数组中数字出现的次数 IIhttps://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II/README.md
57https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof
和为 s 的两个数字https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97/README.md
57 - IIhttps://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof
和为 s 的连续正数序列https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857%20-%20II.%20%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/README.md
58 - Ihttps://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof
翻转单词顺序https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F/README.md
58 - IIhttps://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof
左旋转字符串https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md
59 - Ihttps://leetcode.cn/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof
滑动窗口的最大值https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20I.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/README.md
59 - IIhttps://leetcode.cn/problems/dui-lie-de-zui-da-zhi-lcof
队列的最大值https://github.com/afeesps/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
60https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof
n 个骰子的点数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9860.%20n%E4%B8%AA%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0/README.md
61https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof
扑克牌中的顺子https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9861.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90/README.md
62https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof
圆圈中最后剩下的数字https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9862.%20%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%E5%AD%97/README.md
63https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof
股票的最大利润https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9863.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/README.md
64https://leetcode.cn/problems/qiu-12n-lcof
求 1+2+…+nhttps://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn/README.md
65https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof
不用加减乘除做加法https://github.com/afeesps/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
66https://leetcode.cn/problems/gou-jian-cheng-ji-shu-zu-lcof
构建乘积数组https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9866.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84/README.md
67https://leetcode.cn/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof
把字符串转换成整数https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9867.%20%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/README.md
68 - Ihttps://leetcode.cn/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof
二叉搜索树的最近公共祖先https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md
68 - IIhttps://leetcode.cn/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof
二叉树的最近公共祖先https://github.com/afeesps/leetcode_/blob/main/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md
https://github.com/afeesps/leetcode_/tree/main/lcof#版权
GitHub 开源社区 Doocshttps://github.com/doocs
https://github.com/afeesps/leetcode_/tree/main/lcof#联系我们
https://camo.githubusercontent.com/43b6dd75ba7c1d4926d29af0eb47c0ae65b4eeb418115850c00ea6a025a3e38c/68747470733a2f2f63646e2d646f6f63732e6f73732d636e2d7368656e7a68656e2e616c6979756e63732e636f6d2f67682f646f6f63732f696d616765732f7172636f64652d666f722d79616e676c626d652e706e67
https://github.com/afeesps/leetcode_/tree/main/lcof#许可证
知识共享 版权归属-相同方式共享 4.0 国际 公共许可证http://creativecommons.org/licenses/by-sa/4.0/
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.