| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /:user_id/:repository |
| route-controller | files |
| route-action | disambiguate |
| fetch-nonce | v2:be157404-dea1-e93d-78b3-b5e766f55b20 |
| current-catalog-service-hash | f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb |
| request-id | ACFC:F880B:2CDEAE:3B54C7:6AFF76DC |
| html-safe-nonce | 165a522dc8eea0556662b6173d46c015ffe35abbbcc2db8f1f235e1923ae18b4 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBQ0ZDOkY4ODBCOjJDREVBRTozQjU0Qzc6NkFGRjc2REMiLCJ2aXNpdG9yX2lkIjoiODkyMzI2OTQ0MDg4NDE0MzgzNyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | 06ddaa305d2dab560a561f936efe6b430c7797d6632b88d5023b637f43154d0b |
| hovercard-subject-tag | repository:328581753 |
| 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/CaeCoder/LeetCode |
| twitter:image | https://opengraph.githubassets.com/080984eab6d9e6592627a32eb7c4c3f4886082c0933538c7da729c9c942854f8/CaeCoder/LeetCode |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/080984eab6d9e6592627a32eb7c4c3f4886082c0933538c7da729c9c942854f8/CaeCoder/LeetCode |
| og:image:alt | :monkey:LeetCode、剑指Offer刷题笔记(C/C++、Python3实现). Contribute to CaeCoder/LeetCode 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 | 35e31dc3576ce5a5753c960de52d6fbb2e3131488d65b48fb38a436f42fcbefe |
| turbo-cache-control | no-cache |
| go-import | github.com/CaeCoder/LeetCode git https://github.com/CaeCoder/LeetCode.git |
| octolytics-dimension-user_id | 46257437 |
| octolytics-dimension-user_login | CaeCoder |
| octolytics-dimension-repository_id | 328581753 |
| octolytics-dimension-repository_nwo | CaeCoder/LeetCode |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | true |
| octolytics-dimension-repository_parent_id | 86141315 |
| octolytics-dimension-repository_parent_nwo | Jack-Cherish/LeetCode |
| octolytics-dimension-repository_network_root_id | 86141315 |
| octolytics-dimension-repository_network_root_nwo | Jack-Cherish/LeetCode |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | ed8a67e95c8353d0d4bc94ad2812a7ecbf91bffa |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| Skip to content | https://redirect.github.com/CaeCoder/LeetCode#start-of-content |
| https://redirect.github.com/ |
| Sign in | https://redirect.github.com/login?return_to=https%3A%2F%2Fgithub.com%2FCaeCoder%2FLeetCode |
| GitHubRepository hosting, code review, and collaboration | https://github.com/platform |
| CopilotAI coding agent for tasks, projects, and automated work | https://github.com/features/copilot |
| ActionsCI/CD and automation | https://github.com/features/actions |
| Code QualityQuality analysis, fixes, and enforcement | https://github.com/features/code-quality |
| CodespacesCloud development environments | https://github.com/features/codespaces |
| Code SecurityVulnerability detection and remediation | https://github.com/security/advanced-security/code-security |
| Secret ProtectionSecret scanning and leak prevention | https://github.com/security/advanced-security/secret-protection |
| All Features | https://github.com/features |
| Documentation | https://docs.github.com/en |
| Training | https://learn.github.com/skills |
| Certifications | https://learn.github.com/credentials |
| Build with Copilot | https://github.com/features/ai |
| Customize Copilot | https://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview |
| Integrations | https://github.com/marketplace |
| Trending repos | https://github.com/trending |
| GitHub Sponsors | https://github.com/open-source/sponsors |
| Developer articles | https://github.com/resources/articles |
| ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place. | https://github.blog/changelog/ |
| Enterprises | https://github.com/enterprise |
| Team | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| 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 |
| See all industries | https://github.com/solutions/industry |
| Why GitHub | https://github.com/why-github |
| Customer Stories | https://github.com/customer-stories |
| Business insights | https://github.com/solutions/executive-insights |
| Trust Center | https://github.com/trust-center |
| GitHub Advanced SecurityEnterprise-grade code security | 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 |
| Documentation | https://docs.github.com/en |
| Resource center | https://github.com/resources |
| Blog | https://github.blog/ |
| Events & webinars | https://github.com/resources/events |
| Community Forum | https://github.com/orgs/community/discussions |
| Customer Stories | https://github.com/customer-stories |
| Integrations | https://github.com/marketplace |
| Customer support | https://help.github.com/ |
| Training | https://learn.github.com/skills |
| GitHub Status | https://www.githubstatus.com/ |
| About | https://github.com/about |
| Partners | https://github.com/partners |
| Changelog | https://github.blog/changelog/ |
| GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub. | https://githubuniverse.com/ |
| Pricing | https://github.com/pricing |
| Sign in | https://redirect.github.com/login?return_to=https%3A%2F%2Fgithub.com%2FCaeCoder%2FLeetCode |
| Sign up | https://redirect.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=CaeCoder%2FLeetCode |
| Reload | https://redirect.github.com/CaeCoder/LeetCode |
| Reload | https://redirect.github.com/CaeCoder/LeetCode |
| Reload | https://redirect.github.com/CaeCoder/LeetCode |
| CaeCoder | https://redirect.github.com/CaeCoder |
| LeetCode | https://redirect.github.com/CaeCoder/LeetCode |
| Code | https://redirect.github.com/CaeCoder/LeetCode |
| Pull requests | https://redirect.github.com/CaeCoder/LeetCode/pulls |
| Actions | https://redirect.github.com/CaeCoder/LeetCode/actions |
| Projects | https://redirect.github.com/CaeCoder/LeetCode/projects |
| Security and quality | https://redirect.github.com/CaeCoder/LeetCode/security |
| Insights | https://redirect.github.com/CaeCoder/LeetCode/pulse |
| https://redirect.github.com/CaeCoder/LeetCode |
| LeetCode | https://redirect.github.com/CaeCoder/LeetCode |
| Jack-Cherish/LeetCode | https://redirect.github.com/Jack-Cherish/LeetCode |
| Notifications | https://redirect.github.com/login?return_to=%2FCaeCoder%2FLeetCode |
| Fork0 (0) | https://redirect.github.com/login?return_to=%2FCaeCoder%2FLeetCode |
| Star0 (0) | https://redirect.github.com/login?return_to=%2FCaeCoder%2FLeetCode |
| cuijiahua.com/blog/learing-algorithm/basis/ | https://cuijiahua.com/blog/learing-algorithm/basis/ |
| Readme | https://redirect.github.com/CaeCoder/LeetCode#readme-ov-file |
| Activity | https://redirect.github.com/CaeCoder/LeetCode/activity |
| 0 forks | https://redirect.github.com/CaeCoder/LeetCode/forks |
| Report repository | https://redirect.github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FCaeCoder%2FLeetCode&report=CaeCoder+%28user%29 |
| Branches | https://redirect.github.com/CaeCoder/LeetCode/branches |
| Tags | https://redirect.github.com/CaeCoder/LeetCode/tags |
| https://redirect.github.com/CaeCoder/LeetCode/branches |
| https://redirect.github.com/CaeCoder/LeetCode/tags |
| 207 Commits | https://redirect.github.com/CaeCoder/LeetCode/commits/master/ |
| https://redirect.github.com/CaeCoder/LeetCode/commits/master/ |
| Array | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Array |
| Array | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Array |
| Hash Table/Easy | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Hash%20Table/Easy |
| Hash Table/Easy | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Hash%20Table/Easy |
| Help | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Help |
| Help | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Help |
| Linked List | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Linked%20List |
| Linked List | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Linked%20List |
| Stack | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Stack |
| Stack | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Stack |
| String | https://redirect.github.com/CaeCoder/LeetCode/tree/master/String |
| String | https://redirect.github.com/CaeCoder/LeetCode/tree/master/String |
| Tree | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Tree |
| Tree | https://redirect.github.com/CaeCoder/LeetCode/tree/master/Tree |
| README.md | https://redirect.github.com/CaeCoder/LeetCode/blob/master/README.md |
| README.md | https://redirect.github.com/CaeCoder/LeetCode/blob/master/README.md |
| README | https://redirect.github.com/CaeCoder/LeetCode |
| https://redirect.github.com/CaeCoder/LeetCode#leetcode |
| 【公众号】 | https://cuijiahua.com/wp-content/uploads/2020/05/gzh-w.jpg |
| 【B站】 | https://space.bilibili.com/331507846 |
| 【微信】 | https://cuijiahua.com/wp-content/uploads/2020/05/gzh-w.jpg |
| https://cuijiahua.com/wp-content/uploads/2020/05/gzh-w.jpg |
| https://cuijiahua.com/wp-content/uploads/2020/05/gzh-w.jpg |
| https://space.bilibili.com/331507846 |
| https://www.zhihu.com/people/Jack--Cui |
| https://blog.csdn.net/c406495762 |
| https://www.toutiao.com/c/user/token/MS4wLjABAAAA5gJtmezUJ6vli2hZvnN13iLnzKLpuF8gGHeS0iVlmNs/ |
| https://juejin.im/user/5ea2ca74e51d4546b50d5f9f |
| https://redirect.github.com/CaeCoder/LeetCode#帮助文档 |
| URL | https://github.com/Jack-Cherish/LeetCode/blob/master/Help/complexitypython.txt |
| https://redirect.github.com/CaeCoder/LeetCode#题目清单 |
| https://redirect.github.com/CaeCoder/LeetCode#array数组 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Easy/1.Two%20Sum.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Easy/1.Two%20Sum.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Medium/11.Container%20With%20Most%20Water.md |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Medium/11.Container%20With%20Most%20Water.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/Array/Medium/11.Container%20With%20Most%20Water.md |
| https://redirect.github.com/CaeCoder/LeetCode#linked-list链表 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/21.Merge%20Two%20Sorted%20Lists/Merge%20Two%20Sorted%20Lists.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/21.Merge%20Two%20Sorted%20Lists/Merge%20Two%20Sorted%20Lists.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/65449271 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/83.Remove%20Duplicates%20from%20Sorted%20List/Remove%20Duplicates%20from%20Sorted%20List.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/83.Remove%20Duplicates%20from%20Sorted%20List/Remove%20Duplicates%20from%20Sorted%20List.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/55106317 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/141.Linked%20List%20Cycle/Linked%20List%20Cycle.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/141.Linked%20List%20Cycle/Linked%20List%20Cycle.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/55054315 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/160.Intersection%20of%20Two%20Linked%20Lists/Intersection%20of%20Two%20Linked%20Lists.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/160.Intersection%20of%20Two%20Linked%20Lists/Intersection%20of%20Two%20Linked%20Lists.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/56036016 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/203.Remove%20Linked%20List%20Elements/Remove%20Linked%20List%20Elements.cpp |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/206.Reverse%20Linked%20List/Reverse%20Linked%20List.py |
| C-迭代 | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/206.Reverse%20Linked%20List/Reverse%20Linked%20List-iteratively.c |
| C-递归 | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/206.Reverse%20Linked%20List/Reverse%20Linked%20List-recursively.c |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/60884576 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/234.Palindrome%20Linked%20List/Palindrome.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/234.Palindrome%20Linked%20List/Palindrome%20Linked%20List.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/64443419 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/237.Delete%20Node%20in%20a%20Linked%20List/Delete%20Node%20in%20a%20Linked%20List.py |
| C | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Easy/237.Delete%20Node%20in%20a%20Linked%20List/Delete%20Node%20in%20a%20Linked%20List.c |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/2.Add%20Two%20Numbers.md |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/2.Add%20Two%20Numbers.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/2.Add%20Two%20Numbers.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/61.Rotate%20List/Rotate%20List.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Linked%20List/Medium/61.Rotate%20List/Rotate%20List.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/65626314 |
| https://redirect.github.com/CaeCoder/LeetCode#stack栈 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/20.Valid%20Parentheses/Valid%20Parentheses.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/70154279 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/155.Min%20Stack/Min%20Stack.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/69372722 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/225.Implement%20Stack%20using%20Queues/Implement%20Stack%20using%20Queues.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/67656851 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/232.Implement%20Queue%20using%20Stacks/Implement%20Queue%20using%20Stacks.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/70149075 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Easy/496.Next%20Greater%20Element%20I/Next%20Greater%20Element%20I.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/69359406 |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Stack/Medium/150.Evaluate%20Reverse%20Polish%20Notation/Evaluate%20Reverse%20Polish%20Notation.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/70233695 |
| https://redirect.github.com/CaeCoder/LeetCode#string字符串 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/13.Roman%20to%20Integer/Roman%20to%20Integer.py |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/tree/master/String/Easy/13.Roman%20to%20Integer |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/14.Longest%20Common%20Prefix/Longest%20Common%20Prefix.py |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/tree/master/String/Easy/14.Longest%20Common%20Prefix |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/28.Implement%20strStr.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/28.Implement%20strStr.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/38.Count%20and%20Say/Count%20and%20Say.py |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/tree/master/String/Easy/38.Count%20and%20Say |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/125.Valid%20Palindrome.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/125.Valid%20Palindrome.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/67.Add%20Binary/Add%20Binary.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/67.Add%20Binary/67.Add%20Binary.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/72519117 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/344.Reverse%20String/Reverse%20String.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/344.Reverse%20String/Reverse%20String.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/70833096 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/345.Reverse%20Vowels%20of%20a%20String.md |
| 博客思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/345.Reverse%20Vowels%20of%20a%20String.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/383.Ransom%20Note.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/383.Ransom%20Note.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/434.Number%20of%20Segments%20in%20a%20String/Number%20of%20Segments%20in%20a%20String.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/434.Number%20of%20Segments%20in%20a%20String/Number%20of%20Segments%20in%20a%20String.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/71786453 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/520.Detect%20Capital/Detect%20Capital.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/520.Detect%20Capital/Detect%20Capital.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/73495803 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/521.Longest%20Uncommon%20Subsequence%20I/Longest%20Uncommon%20Subsequence%20I.py |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/541.Reverse%20String%20II/Reverse%20String%20II.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/541.Reverse%20String%20II/Reverse%20String%20II.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/70884683 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/551.%20Student%20Attendance%20Record%20I/Student%20Attendance%20Record%20I.py |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/557.Reverse%20Words%20in%20a%20String%20III/Reverse%20Words%20in%20a%20String%20III.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/557.Reverse%20Words%20in%20a%20String%20III/Reverse%20Words%20in%20a%20String%20III.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/73457057 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Easy/657.Judge%20Route%20Circle/Judge%20Route%20Circle.py |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/3.Longest%20Substring%20Without%20Repeating%20Characters.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/3.Longest%20Substring%20Without%20Repeating%20Characters.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/5.Longest%20Palindromic%20Substring.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/5.Longest%20Palindromic%20Substring.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/17.Letter%20Combinations%20of%20a%20Phone%20Number.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/17.Letter%20Combinations%20of%20a%20Phone%20Number.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/22.Generate%20Parentheses.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/22.Generate%20Parentheses.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/43.Multiply%20Strings.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/43.Multiply%20Strings.md |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/609.Find%20Duplicate%20File%20in%20System.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/String/Medium/609.Find%20Duplicate%20File%20in%20System.md |
| https://redirect.github.com/CaeCoder/LeetCode#tree树 |
| Py-1 | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/111.Minimum%20Depth%20of%20Binary%20Tree/Minimum%20Depth%20of%20Binary%20Tree-1.py |
| Py-2 | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/111.Minimum%20Depth%20of%20Binary%20Tree/Minimum%20Depth%20of%20Binary%20Tree-2.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/111.Minimum%20Depth%20of%20Binary%20Tree/Minimum%20Depth%20of%20Binary%20Tree.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/75043140 |
| Py-1 | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/112.Path%20Sum/Path%20Sum-1.py |
| Py-2 | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/112.Path%20Sum/Path%20Sum-2.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/112.Path%20Sum/Path%20Sum.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/76172233 |
| Py-1 | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree-1.py |
| Py-2 | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree-2.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/75497795 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/501.Find%20Mode%20in%20Binary%20Search%20Tree/Find%20Mode%20in%20Binary%20Search%20Tree.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/501.Find%20Mode%20in%20Binary%20Search%20Tree/Find%20Mode%20in%20Binary%20Search%20Tree.cpp |
| 博客思路讲解 | http://blog.csdn.net/c406495762/article/details/76046469 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/543.Diameter%20of%20Binary%20Tree/Diameter%20of%20Binary%20Tree.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/543.Diameter%20of%20Binary%20Tree/Diameter%20of%20Binary%20Tree.cpp |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/606.Construct%20String%20from%20Binary%20Tree/Construct%20String%20from%20Binary%20Tree.py |
| C++ | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Easy/606.Construct%20String%20from%20Binary%20Tree/Construct%20String%20from%20Binary%20Tree.cpp |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Tree/Medium/113.Path%20Sum%20II/Path%20Sum%20II.py |
| https://redirect.github.com/CaeCoder/LeetCode#hash-table哈希表 |
| Python | https://github.com/Jack-Cherish/LeetCode/blob/master/Hash%20Table/Easy/290.Word%20Pattern.md |
| 思路讲解 | https://github.com/Jack-Cherish/LeetCode/blob/master/Hash%20Table/Easy/290.Word%20Pattern.md |
| https://redirect.github.com/CaeCoder/LeetCode#剑指offer已完成 |
| 个人网站 | http://cuijiahua.com/ |
| https://redirect.github.com/CaeCoder/LeetCode#链表8道 |
| 剑指Offer(三):从尾到头打印链表 | http://cuijiahua.com/blog/2017/11/basis_3.html |
| 剑指Offer(十四):链表中倒数第k个结点 | http://cuijiahua.com/blog/2017/12/basis_14.html |
| 剑指Offer(十五):反转链表 | http://cuijiahua.com/blog/2017/12/basis_15.html |
| 剑指Offer(十六):合并两个排序的链表 | http://cuijiahua.com/blog/2017/12/basis_16.html |
| 剑指Offer(二十五):复杂链表的复制 | http://cuijiahua.com/blog/2017/12/basis_25.html |
| 剑指Offer(三十六):两个链表的第一个公共结点 | http://cuijiahua.com/blog/2018/01/basis_36.html |
| 剑指Offer(五十五):链表中环的入口结点 | http://cuijiahua.com/blog/2018/01/basis_55.html |
| 剑指Offer(五十六):删除链表中重复的结点 | http://cuijiahua.com/blog/2018/01/basis_56.html |
| https://redirect.github.com/CaeCoder/LeetCode#二叉树12道 |
| 剑指Offer(四):重建二叉树 | http://cuijiahua.com/blog/2017/11/basis_4.html |
| 剑指Offer(十七):树的子结构 | http://cuijiahua.com/blog/2017/12/basis_17.html |
| 剑指Offer(十八):二叉树的镜像 | http://cuijiahua.com/blog/2017/12/basis_18.html |
| 剑指Offer(二十二):从上往下打印二叉树 | http://cuijiahua.com/blog/2017/12/basis_22.html |
| 剑指Offer(二十四):二叉树中和为某一值的路径 | http://cuijiahua.com/blog/2017/12/basis_24.html |
| 剑指Offer(三十八):二叉树的深度 | http://cuijiahua.com/blog/2018/01/basis_38.html |
| 剑指Offer(三十九):平衡二叉树 | http://cuijiahua.com/blog/2018/01/basis_39.html |
| 剑指Offer(五十七):二叉树的下一个结点 | http://cuijiahua.com/blog/2018/01/basis_57.html |
| 剑指Offer(五十八):对称的二叉树 | http://cuijiahua.com/blog/2018/01/basis_58.html |
| 剑指Offer(五十九):按之字顺序打印二叉树 | http://cuijiahua.com/blog/2018/01/basis_59.html |
| 剑指Offer(六十):把二叉树打印成多行 | http://cuijiahua.com/blog/2018/01/basis_60.html |
| 剑指Offer(六十一):序列化二叉树 | http://cuijiahua.com/blog/2018/01/basis_61.html |
| https://redirect.github.com/CaeCoder/LeetCode#二叉搜索树3道 |
| 剑指Offer(二十三):二叉搜索树的后序遍历序列 | http://cuijiahua.com/blog/2017/12/basis_23.html |
| 剑指Offer(二十六):二叉搜索树与双向链表 | http://cuijiahua.com/blog/2017/12/basis_26.html |
| 剑指Offer(六十二):二叉搜索树的第k个结点 | http://cuijiahua.com/blog/2018/01/basis_62.html |
| https://redirect.github.com/CaeCoder/LeetCode#数组11道 |
| 剑指Offer(一):二维数组中的查找 | http://cuijiahua.com/blog/2017/11/basis_1.html |
| 剑指Offer(六):旋转数组的最小数字 | http://cuijiahua.com/blog/2017/11/basis_6.html |
| 剑指Offer(十三):调整数组顺序使奇数位于偶数前面 | http://cuijiahua.com/blog/2017/11/basis_13.html |
| 剑指Offer(二十八):数组中出现次数超过一半的数字 | http://cuijiahua.com/blog/2017/12/basis_28.html |
| 剑指Offer(三十):连续子数组的最大和 | http://cuijiahua.com/blog/2017/12/basis_30.html |
| 剑指Offer(三十二):把数组排成最小的数 | http://cuijiahua.com/blog/2018/01/basis_32.html |
| 剑指Offer(三十五):数组中的逆序对 | http://cuijiahua.com/blog/2018/01/basis_35.html |
| 剑指Offer(三十七):数字在排序数组中出现的次数 | http://cuijiahua.com/blog/2018/01/basis_37.html |
| 剑指Offer(四十):数组中只出现一次的数字 | http://cuijiahua.com/blog/2018/01/basis_40.html |
| 剑指Offer(五十):数组中重复的数字 | http://cuijiahua.com/blog/2018/01/basis_50.html |
| 剑指Offer(五十一):构建乘积数组 | http://cuijiahua.com/blog/2018/01/basis_51.html |
| https://redirect.github.com/CaeCoder/LeetCode#字符串8道 |
| 剑指Offer(二):替换空格 | http://cuijiahua.com/blog/2017/11/basis_2.html |
| 剑指Offer(二十七):字符串的排列 | http://cuijiahua.com/blog/2017/12/basis_27.html |
| 剑指Offer(三十四):第一个只出现一次的字符 | http://cuijiahua.com/blog/2018/01/basis_34.html |
| 剑指Offer(四十三):左旋转字符串 | http://cuijiahua.com/blog/2018/01/basis_43.html |
| 剑指Offer(四十四):翻转单词顺序序列 | http://cuijiahua.com/blog/2018/01/basis_44.html |
| 剑指Offer(四十九):把字符串转换成整数 | http://cuijiahua.com/blog/2018/01/basis_49.html |
| 剑指Offer(五十二):正则表达式匹配 | http://cuijiahua.com/blog/2018/01/basis_52.html |
| 剑指Offer(五十三):表示数值的字符串 | http://cuijiahua.com/blog/2018/01/basis_53.html |
| https://redirect.github.com/CaeCoder/LeetCode#栈3道 |
| 剑指Offer(五):用两个栈实现队列 | http://cuijiahua.com/blog/2017/11/basis_5.html |
| 剑指Offer(二十):包含min函数的栈 | http://cuijiahua.com/blog/2017/12/basis_20.html |
| 剑指Offer(二十一):栈的压入、弹出序列 | http://cuijiahua.com/blog/2017/12/basis_21.html |
| https://redirect.github.com/CaeCoder/LeetCode#递归4道 |
| 剑指Offer(七):裴波那契数列 | http://cuijiahua.com/blog/2017/11/basis_7.html |
| 剑指Offer(八):跳台阶 | http://cuijiahua.com/blog/2017/11/basis_8.html |
| 剑指Offer(九):变态跳台阶 | http://cuijiahua.com/blog/2017/11/basis_9.html |
| 剑指Offer(十):矩形覆盖 | http://cuijiahua.com/blog/2017/11/basis_10.html |
| https://redirect.github.com/CaeCoder/LeetCode#回溯法2道 |
| 剑指Offer(六十五):矩阵中的路径 | http://cuijiahua.com/blog/2018/02/basis_65.html |
| 剑指Offer(六十六):机器人的运动范围 | http://cuijiahua.com/blog/2018/02/basis_66.html |
| https://redirect.github.com/CaeCoder/LeetCode#其他15道 |
| 剑指Offer(十一):二进制中1的个数 | http://cuijiahua.com/blog/2017/11/basis_11.html |
| 剑指Offer(十二):数值的整数次方 | http://cuijiahua.com/blog/2017/11/basis_12.html |
| 剑指Offer(十九):顺时针打印矩阵 | http://cuijiahua.com/blog/2017/12/basis_19.html |
| 剑指Offer(二十九):最小的K个数 | http://cuijiahua.com/blog/2017/12/basis_29.html |
| 剑指Offer(三十一):整数中1出现的次数(从1到n整数中1出现的次数) | http://cuijiahua.com/blog/2017/12/basis_31.html |
| 剑指Offer(三十三):丑数 | http://cuijiahua.com/blog/2018/01/basis_33.html |
| 剑指Offer(四十一):和为S的连续正数序列 | http://cuijiahua.com/blog/2018/01/basis_41.html |
| 剑指Offer(四十二):和为S的两个数字 | http://cuijiahua.com/blog/2018/01/basis_42.html |
| 剑指Offer(四十五):扑克牌顺子 | http://cuijiahua.com/blog/2018/01/basis_45.html |
| 剑指Offer(四十六):孩子们的游戏(圆圈中最后剩下的数) | http://cuijiahua.com/blog/2018/01/basis_46.html |
| 剑指Offer(四十七):求1+2+3+…+n | http://cuijiahua.com/blog/2018/01/basis_47.html |
| 剑指Offer(四十八):不用加减乘除的加法 | http://cuijiahua.com/blog/2018/01/basis_48.html |
| 剑指Offer(五十四):字符流中第一个不重复的字符 | http://cuijiahua.com/blog/2018/01/basis_54.html |
| 剑指Offer(六十三):数据流中的中位数 | http://cuijiahua.com/blog/2018/02/basis_63.html |
| 剑指Offer(六十四):滑动窗口的最大值 | http://cuijiahua.com/blog/2018/02/basis_64.html |
| https://camo.githubusercontent.com/4b21a497f0cef22ec53aacab8ae89df24aa51da970e676f91adf579284f03b23/68747470733a2f2f6674702e626d702e6f76682f696d67732f323032302f30372f313132323534663031393965336434662e6a7067 |
| cuijiahua.com/blog/learing-algorithm/basis/ | https://cuijiahua.com/blog/learing-algorithm/basis/ |
| Readme | https://redirect.github.com/CaeCoder/LeetCode#readme-ov-file |
| Activity | https://redirect.github.com/CaeCoder/LeetCode/activity |
| 0 forks | https://redirect.github.com/CaeCoder/LeetCode/forks |
| Report repository | https://redirect.github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FCaeCoder%2FLeetCode&report=CaeCoder+%28user%29 |
|
| 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 |