{"id":15037812,"url":"https://github.com/krahets/leetcode-book","last_synced_at":"2025-05-14T08:09:52.457Z","repository":{"id":37364171,"uuid":"439355916","full_name":"krahets/LeetCode-Book","owner":"krahets","description":"《剑指 Offer》 Python, Java, C++ 解题代码，LeetBook《图解算法数据结构》配套代码仓","archived":false,"fork":false,"pushed_at":"2024-05-11T07:33:48.000Z","size":858,"stargazers_count":7288,"open_issues_count":2,"forks_count":829,"subscribers_count":49,"default_branch":"main","last_synced_at":"2025-05-14T08:09:46.331Z","etag":null,"topics":["algorithm","algorithms","algorithms-and-data-structures","data-structure","data-structures","java","leetcode","leetcode-cpp","leetcode-java","leetcode-python","python","sword-for-offer"],"latest_commit_sha":null,"homepage":"https://leetcode-cn.com/leetbook/detail/illustration-of-algorithm/","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/krahets.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-12-17T14:16:02.000Z","updated_at":"2025-05-14T07:41:37.000Z","dependencies_parsed_at":"2023-01-23T08:45:23.140Z","dependency_job_id":"fb3041c3-3442-4906-97d7-94b7a229e92f","html_url":"https://github.com/krahets/LeetCode-Book","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krahets%2FLeetCode-Book","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krahets%2FLeetCode-Book/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krahets%2FLeetCode-Book/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krahets%2FLeetCode-Book/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/krahets","download_url":"https://codeload.github.com/krahets/LeetCode-Book/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254101559,"owners_count":22014908,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["algorithm","algorithms","algorithms-and-data-structures","data-structure","data-structures","java","leetcode","leetcode-cpp","leetcode-java","leetcode-python","python","sword-for-offer"],"created_at":"2024-09-24T20:35:49.071Z","updated_at":"2025-05-14T08:09:47.448Z","avatar_url":"https://github.com/krahets.png","language":"Java","readme":"\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://leetcode-cn.com/leetbook/detail/illustration-of-algorithm/\"\u003e\n    \u003cimg src=\"https://pic.leetcode-cn.com/1599187248-gDiWnC-image.png\" width=\"490\"\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/LeetCode%20tests-75%20accepted-brightgreen\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Language-Python-teal\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Language-Java-orange\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Language-C++-blue\"\u003e\n\u003c/p\u003e\n\n[《图解算法数据结构》](https://leetcode-cn.com/leetbook/detail/illustration-of-algorithm/)是一本面向算法初学者和互联网求职者编写的 LeetBook 手册。\n\n- 图文详解 75 道题目，覆盖主要算法知识点。\n- 题目活跃于各大互联网公司招聘中，可使笔面试准备事半功倍。\n- 致力于行文深入浅出、图文搭配，提供简洁的 Python, Java, C++ 解题代码。\n\n\u003e [!NOTE]  \n\u003e\n\u003e 本仓库包含“图解算法数据结构”、“Krahets 笔面试精选 88 题”和“剑指 Offer”的题解内容：\n\u003e \n\u003e ```python\n\u003e LeetCode-Book\n\u003e ├── leetbook_ioa               # 《图解算法数据结构》题解和专栏文档\n\u003e ├── selected_coding_interview  # 《Krahets 笔面试精选 88 题》题解文档\n\u003e └── sword_for_offer            # 《剑指 Offer》题解文档、代码、刷题计划\n\u003e ```\n\n\u003e 若本仓库对您有所帮助，请在页面右上角点个 **Star** :star: 支持一下，谢谢！\n\n## 如何学习算法\n\n### 第一步：看入门书\n\n\u003cp align=\"center\" href=\"https://github.com/krahets/hello-algo\"\u003e\n  \u003cimg src=\"https://www.hello-algo.com/index.assets/hello_algo_header.png\" width=\"550\"\u003e\n\u003c/p\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://github.com/krahets/hello-algo\"\u003e《Hello 算法》\u003c/a\u003e —— 动画图解、一键运行的数据结构与算法教程\n\u003c/p\u003e\n\n此书旨在引导初学者探索数据结构与算法的知识地图，掌握刷题需要的前置知识与工具库。\n\n\u003e [!TIP]\n\u003e 建议先读完这本书（概括且全面地了解数据结构与算法），再开始刷题（深入探索各类算法和数据结构）。\n\n### 第二步：刷算法题\n\n推荐以下 LeetCode 题单：\n\n1. [Krahets 笔面试精选 88 题](https://leetcode.cn/studyplan/selected-coding-interview/)：从“剑指 Offer”和“热题 100”精选出的 88 道高频算法笔试题，适合初学者入门。\n2. [图解算法数据结构](https://leetcode-cn.com/leetbook/detail/illustration-of-algorithm/)（[Interview-75](https://leetcode.cn/studyplan/coding-interviews/)）：题目更贴近实际应用，相较于“剑指 Offer”难度有所增加。\n3. [LeetCode 热题 100](https://leetcode.cn/studyplan/top-100-liked/)：力扣用户最喜爱的 100 道题。\n4. [面试经典 150 题](https://leetcode.cn/studyplan/top-interview-150/)：150 道经典面试力扣题。\n5. [LeetCode-75](https://leetcode.cn/studyplan/leetcode-75/)：精选 75 道面试核心题目。\n\n\u003e [!TIP]\n\u003e 第 `1.` `2.` 项的题目分类与《Hello 算法》的章节内容对应，且提供 [@krahets](https://leetcode.cn/u/jyd/) 写的题解，适合作为配套习题。\n\n对初学者刷题的一些建议：\n\n1. 建议每日刷 2～3 题。若能轻松完成，可以尝试增加至 5～8 题。\n2. 刷题的质量比数量更加重要。请确保你真正理解了每个题目的解法及背后的算法原理。\n3. 建议你按照题单目录的顺序做题。如果感觉一道题很难，可以先跳过，后续再攻克。\n4. 题目通常有不止一种解法，请你注意比较和探讨各种方法的特点和适用情况。\n5. 如果你发现自己遗忘了题目解法，不必灰心；我们通常需要复习三次以上，才能真正掌握一个知识点。\n6. 行百里者半九十。坚持至关重要，加油！\n\n## License\n\nThe texts, code, and images in this repository are licensed under [CC BY-NC-SA-4.0](https://creativecommons.org/licenses/by-nc-sa/4.0/).\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkrahets%2Fleetcode-book","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkrahets%2Fleetcode-book","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkrahets%2Fleetcode-book/lists"}