{"id":17349483,"url":"https://github.com/murufeng/leetcode-algorithm","last_synced_at":"2026-05-01T10:31:44.448Z","repository":{"id":112967915,"uuid":"257595904","full_name":"murufeng/LeetCode-Algorithm","owner":"murufeng","description":"剑指Offer \u0026 LeetCode Problems' Solutions: A Record of My Problem Solving Journey（Python,C++)）","archived":false,"fork":false,"pushed_at":"2021-08-15T15:01:03.000Z","size":316,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-27T11:44:57.843Z","etag":null,"topics":["algorithms-and-data-structures","coding-interviews","cplusplus","leetcode-solutions","python3"],"latest_commit_sha":null,"homepage":"https://github.com/murufeng/LeetCode-Algorithm","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/murufeng.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-04-21T12:57:25.000Z","updated_at":"2023-04-21T03:05:02.000Z","dependencies_parsed_at":null,"dependency_job_id":"8b3b907e-a05e-4be2-95e1-898161891762","html_url":"https://github.com/murufeng/LeetCode-Algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/murufeng/LeetCode-Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/murufeng%2FLeetCode-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/murufeng%2FLeetCode-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/murufeng%2FLeetCode-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/murufeng%2FLeetCode-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/murufeng","download_url":"https://codeload.github.com/murufeng/LeetCode-Algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/murufeng%2FLeetCode-Algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32494270,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-30T13:12:12.517Z","status":"online","status_checked_at":"2026-05-01T02:00:05.856Z","response_time":64,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","coding-interviews","cplusplus","leetcode-solutions","python3"],"created_at":"2024-10-15T16:56:14.153Z","updated_at":"2026-05-01T10:31:44.439Z","avatar_url":"https://github.com/murufeng.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode-Algorithm\n\n[![Travis](https://img.shields.io/badge/language-C++-green.svg)]()\n[![Travis](https://img.shields.io/badge/language-Python-red.svg)]()\n\n\n[![](https://img.shields.io/badge/Zhihu-知乎-blue)](https://www.zhihu.com/people/qiu-feng-2-80)\n\n\n[![GitHub stars](https://img.shields.io/github/stars/murufeng/LeetCode-Algorithm.svg?style=social\u0026label=Stars)](https://github.com/murufeng/LeetCode-Algorithm)\n[![GitHub forks](https://img.shields.io/github/forks/murufeng/LeetCode-Algorithm.svg?style=social\u0026label=Forks)](https://github.com/murufeng/LeetCode-Algorithm)\n\n\u003e 统计数据的时间是从 2020-4-22 21:00 起至今\n\n\n\n## 介绍\n\nleetcode 与 剑指Offer面试 题解，记录自己的 数据结构与算法 刷题之路。\n\n本仓库目前分为**两个**部分：\n\n- 第一个部分是 leetcode \u0026 剑指Offer 经典题目的解析，包括思路，关键点和具体的代码实现。\n\n- 第二部分是对于数据结构与算法的总结\n\n\n\n其中算法，主要是以下几种：\n\n- 基础技巧：分治、二分、贪心、双指针\n- 排序算法：快速排序、归并排序、计数排序\n- 搜索算法：二分搜索、回溯、递归、深度优先遍历，广度优先遍历，二叉搜索树等\n- 图论：最短路径、最小生成树\n- 动态规划：背包问题、最长子序列\n\n数据结构，主要有如下几种：\n\n- 数组与链表：单 / 双向链表\n- 栈与队列\n- 哈希表\n- 堆：最大堆 ／ 最小堆\n- 树与图：二叉树、二叉搜索树、最近公共祖先、并查集\n- 字符串：前缀树（字典树） ／ 后缀树\n\n\n## 传送门\n\n### 一、剑指Offer面试经典题目的解析\n   **一.数组**\n - [剑指Offer（一）：二维数组中的查找](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/1.%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.md)\n\n - [剑指Offer（六）：旋转数组的最小数字](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/2.%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md)\n\n- [旋转数组的最小数字II](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/2_1.%E5%AF%BB%E6%89%BE%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E5%80%BC%20II.md)\n\n - [剑指Offer（十三）：调整数组顺序使奇数位于偶数前面](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/3.%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.md)\n -  **数字在数组中出现的次数问题**\n    - [剑指Offer（三十七）：数字在排序数组中出现的次数](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/5.%20%E7%BB%9F%E8%AE%A1%E6%95%B0%E5%AD%97%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0.md)\n\n    - [剑指Offer（四十）：数组中只出现一次的数字](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/6.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E6%95%B0%E5%AD%97.md)\n\n    - [剑指Offer（五十）：数组中重复的数字](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/7.%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.md)\n\n    - [剑指Offer（二十八）：数组中出现次数超过一半的数字](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/4.%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.md)\n\n - [剑指Offer（三十）：连续子数组的最大和](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/8.%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.md)\n\n - [剑指Offer（三十二）：把数组排成最小的数](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/10.%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0.md)\n\n - [剑指Offer（三十五）：数组中的逆序对](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/11.%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9.md)\n\n - [剑指Offer（五十一）：构建乘积数组](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%95%B0%E7%BB%84/9.%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84.md)\n\n\n\n**二、栈和队列**\n- [剑指Offer（五）：用两个栈实现队列](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97/2.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E6%9D%A5%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md)\n\n- [剑指Offer（二十）：包含min函数的栈](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97/3.%20%E5%8C%85%E5%90%ABmain%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md)\n\n- [剑指Offer（二十一）：栈的压入、弹出序列](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E6%A0%88%E5%92%8C%E9%98%9F%E5%88%97/1.%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.md)\n\n**三、链表**\n\n- [剑指Offer（三）：从尾到头打印链表](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/1.%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.md)\n\n- [剑指Offer（十四）：链表中倒数第k个结点](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/2.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACK%E4%B8%AA%E7%BB%93%E7%82%B9.md)\n\n- [剑指Offer（十五）：反转链表](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/3.%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md)\n\n- [剑指Offer（十六）：合并两个排序的链表](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/4.%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.md)\n\n- 剑指Offer（二十五）：复杂链表的复制\n\n- [剑指Offer（三十六）：两个链表的第一个公共结点](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/36.%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E5%85%AC%E5%85%B1%E7%BB%93%E7%82%B9.md)\n\n- [剑指Offer（五十五）：链表中环的入口结点](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/55.%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.md)\n\n- [剑指Offer（五十六）：删除链表中重复的结点](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%93%BE%E8%A1%A8/%E5%89%91%E6%8C%87Offer%EF%BC%88%E4%BA%94%E5%8D%81%E5%85%AD%EF%BC%89_%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E7%BB%93%E7%82%B9.md)\n\n \n **四、字符串**\n - [剑指Offer(二)：替换空格](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%AD%97%E7%AC%A6%E4%B8%B2/1.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md)\n\n - 剑指Offer（二十七）：字符串的排列\n\n - [剑指Offer（三十四）：第一个只出现一次的字符](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%AD%97%E7%AC%A6%E4%B8%B2/3.%20%E7%AC%AC%E4%B8%80%E6%AC%A1%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.md)\n\n - 剑指Offer（四十三）：左旋转字符串\n\n - [剑指Offer（四十四）：翻转单词顺序序列](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%AD%97%E7%AC%A6%E4%B8%B2/5.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F.md)\n\n - 剑指Offer（四十九）：把字符串转换成整数\n\n - 剑指Offer（五十二）：正则表达式匹配\n\n - 剑指Offer（五十三）：表示数值的字符串\n\n**五、二叉树**\n- [剑指Offer（四）：重建二叉树](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/1.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n\n- 剑指Offer（十七）：树的子结构\n\n- [剑指Offer（十八）：二叉树的镜像](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/3.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F.md)\n\n- [剑指Offer（二十二）：从上往下打印二叉树](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/4.%20%E4%BB%8E%E4%B8%8A%E5%BE%80%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n\n- [剑指Offer（二十四）：二叉树中和为某一值的路径](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/5.%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.md)\n\n- [剑指Offer（三十八）：二叉树的深度](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/6.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6.md)\n\n- [剑指Offer（三十九）：平衡二叉树](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/7.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n\n- 剑指Offer（五十七）：二叉树的下一个结点\n\n- [剑指Offer（五十八）：对称的二叉树](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/9.%20%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n\n- [剑指Offer（五十九）：按之字顺序打印二叉树](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/10.%E6%8C%89%E4%B9%8B%E5%AD%97%E9%A1%BA%E5%BA%8F%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n\n- [剑指Offer（六十）：把二叉树打印成多行](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%A0%91/11.%20%E6%8A%8A%E4%BA%8C%E5%8F%89%E6%A0%91%E6%89%93%E5%8D%B0%E6%88%90%E5%A4%9A%E8%A1%8C.md)\n\n- 剑指Offer（六十一）：序列化二叉树\n\n\n**六、二叉搜索树**\n- [剑指Offer（二十三）：二叉搜索树的后序遍历序列](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/1.%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.md)\n\n- [剑指Offer（二十六）：二叉搜索树与双向链表](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/26.%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.md)\n\n- [剑指Offer（六十二）：二叉搜索树的第k个结点](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/62.%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.md)\n\n**七、递归**\n- [剑指Offer（七）：裴波那契数列](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%80%92%E5%BD%92/1.%E8%A3%B4%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md)\n\n- [剑指Offer（八）：跳台阶](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%80%92%E5%BD%92/2.%20%E8%B7%B3%E5%8F%B0%E9%98%B6.md)\n\n- [剑指Offer（九）：变态跳台阶](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%80%92%E5%BD%92/3.%20%E5%8F%98%E6%80%81%E8%B7%B3%E5%8F%B0%E9%98%B6.md)\n\n- [剑指Offer（十）：矩形覆盖](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E9%80%92%E5%BD%92/4.%20%E7%9F%A9%E5%BD%A2%E8%A6%86%E7%9B%96.md)\n\n**八、回溯法**\n- 剑指Offer（六十五）：矩阵中的路径\n\n- 剑指Offer（六十六）：机器人的运动范围\n\n**九、其他**\n- [剑指Offer（十一）：二进制中1的个数](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BD%8D%E8%BF%90%E7%AE%97/2.%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0.md)\n\n- 剑指Offer（十二）：数值的整数次方\n\n- [剑指Offer（十九）：顺时针打印矩阵](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/3.%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5.md)\n\n- [剑指Offer（二十九）：最小的K个数](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/4.%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0.md)\n\n- [剑指Offer（三十一）：整数中1出现的次数（从1到n整数中1出现的次数）](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BD%8D%E8%BF%90%E7%AE%97/3.%20%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%EF%BC%88%E4%BB%8E1%E5%88%B0n%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%EF%BC%89.md)\n\n- 剑指Offer（三十三）：丑数\n\n- [剑指Offer（四十一）：和为S的连续正数序列](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/7.%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.md)\n\n- [剑指Offer（四十二）：和为S的两个数字](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/6.%20%E5%92%8C%E4%B8%BAS%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97.md)\n\n- [剑指Offer（四十五）：扑克牌顺子](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/61.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90.md)\n\n- [剑指Offer（四十六）：孩子们的游戏（圆圈中最后剩下的数）](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/10.%E5%AD%A9%E5%AD%90%E4%BB%AC%E7%9A%84%E6%B8%B8%E6%88%8F.md)\n\n- [剑指Offer（四十七）：求1+2+3+…+n](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E5%85%B6%E4%BB%96/11.%20%E6%B1%821%2B2%2B3%2B...%2Bn%E7%9A%84%E5%80%BC.md)\n\n- [剑指Offer（四十八）：不用加减乘除的加法](https://github.com/murufeng/LeetCode-Algorithm/blob/master/%E5%89%91%E6%8C%87Offer%E7%B3%BB%E5%88%97/%E4%BD%8D%E8%BF%90%E7%AE%97/1.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E7%9A%84%E5%8A%A0%E6%B3%95.md)\n\n- 剑指Offer（五十四）：字符流中第一个不重复的字符\n\n- 剑指Offer（六十三）：数据流中的中位数\n\n- 剑指Offer（六十四）：滑动窗口的最大值\n\n \n### 二、LeetCode经典题目解析\n - [栈与队列](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97)\n - [单/双向链表、哈希表](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E9%93%BE%E8%A1%A8)\n - [数组与字符串](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E6%95%B0%E7%BB%84%E4%B8%8E%E5%AD%97%E7%AC%A6%E4%B8%B2)\n - 堆（最小/大堆）\n - 位运算\n - [查找与排序（二分法、排序算法总结）](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE)\n - [二叉树(搜索与遍历)](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E4%BA%8C%E5%8F%89%E6%A0%91)\n - [深度优先搜索](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E7%B3%BB%E5%88%97%E4%B8%93%E9%A2%98)\n - 广度优先搜素\n - [递归、回溯](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E5%9B%9E%E6%BA%AF%E6%B3%95)\n - 贪心算法\n - 双指针\n - [动态规划](https://github.com/murufeng/LeetCode-Algorithm/tree/master/LeetCode%E9%A2%98%E8%A7%A3/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92)\n - 图\n \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmurufeng%2Fleetcode-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmurufeng%2Fleetcode-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmurufeng%2Fleetcode-algorithm/lists"}