{"id":13630935,"url":"https://github.com/Xunzhuo/Algorithm-Guide","last_synced_at":"2025-04-17T17:32:07.287Z","repository":{"id":37721462,"uuid":"259780361","full_name":"Xunzhuo/Algorithm-Guide","owner":"Xunzhuo","description":"Xunzhuo`s Tutorials of Algorithm and Data Structure  🚀🚀🚀","archived":false,"fork":false,"pushed_at":"2022-01-20T13:38:49.000Z","size":522566,"stargazers_count":1629,"open_issues_count":0,"forks_count":258,"subscribers_count":62,"default_branch":"master","last_synced_at":"2025-04-08T14:06:41.395Z","etag":null,"topics":["acm","algorithms","c","datastructure","datastructures-algorithms","icpc","interview","job"],"latest_commit_sha":null,"homepage":"https://www.liuxunzhuo.com","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Xunzhuo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-04-29T00:04:11.000Z","updated_at":"2025-04-05T13:24:04.000Z","dependencies_parsed_at":"2022-07-12T16:43:50.102Z","dependency_job_id":null,"html_url":"https://github.com/Xunzhuo/Algorithm-Guide","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Xunzhuo%2FAlgorithm-Guide","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Xunzhuo%2FAlgorithm-Guide/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Xunzhuo%2FAlgorithm-Guide/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Xunzhuo%2FAlgorithm-Guide/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Xunzhuo","download_url":"https://codeload.github.com/Xunzhuo/Algorithm-Guide/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249360042,"owners_count":21257160,"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":["acm","algorithms","c","datastructure","datastructures-algorithms","icpc","interview","job"],"created_at":"2024-08-01T22:02:03.814Z","updated_at":"2025-04-17T17:32:06.840Z","avatar_url":"https://github.com/Xunzhuo.png","language":"Java","readme":"\u003cdiv align =\"center\"\u003e\n  \u003ch1\u003e\n    Algorithm Guide\n  \u003c/h1\u003e\n  \u003c/div\u003e\n\n本仓库带你系统掌握程序员必知必会的**算法**和**数据结构**\n\n本仓库主要有**两个分支**：\n\n+ **master分支**：最近的新分支，也是以后日常维护的主分支，内容为算法和数据结构的教程。\n\n+ **Collections 分支**：以前的主分支，整理了算法和数据结构的资料，现作为辅助分支：[这里访问](https://github.com/Xunzhuo/Algorithms-in-4-Steps/tree/Collections)\n\n \u003e **算法部分**基本完成，**数据结构**还有很多未完成部分，空闲时会加快完善\n\n## 目录：\n\n1. [算法篇](#算法篇)\n2. [数据结构篇](#数据结构篇)\n3. [刷题练习篇](#刷题练习篇)\n\n## 算法篇\n\n+ [一、复杂度分析](algorithm/analysis.md)\n+ [二、高精度算法](algorithm/big-num.md)\n+ [三、排序算法](algorithm/sort.md)\n+ [四、递推算法](algorithm/recursion.md)\n+ [五 、递归算法](algorithm/recursion-2.md)\n+ [六、分治算法](algorithm/bi-divide.md)\n+ [七、贪心算法](algorithm/greedy.md)\n+ [八、广度优先搜索算法](algorithm/bfs.md)\n+ [九、深度优先搜索算法](algorithm/dfs.md)\n+ [十、回溯算法](algorithm/backtrace.md)\n+ [十一、动态规划](algorithm/dynamic%20programming.md)\n+ [十二、字符串算法](algorithm/string.md) \n\n## 数据结构篇\n\n+ [一、栈](data-structure/stack.md)\n+ [二、队列](data-structure/queue.md)\n+ [三、树](data-structure/tree.md) \n+ [四、堆](data-structure/heap.md) \n+ [五、图论算法 ](data-structure/graph.md) \n+ [六、并查集](data-structure/DisjointSets.md)  \n+ [七、最小生成树](data-structure/kruskal.md) \n+ [八、拓扑排序与关键路径](data-structure/key-path.md) \n+ [九、线段树](data-structure/line-tree.md) \n+ [十、树状数组](data-structure/tree-array.md) \n\n##  刷题练习篇\n\n在掌握了重要的算法和数据结构之后，需要练习巩固\n\n#### **网站的选择？**\n\n推荐 **LeetCode**，[这里访问](https://leetcode-cn.com/)\n\n#### **刷哪些题目？**\n\n1. 如果你**时间紧张**：可以练习**LeetCode**的**热门推荐**：\n\n   ![image-20201220164553273](https://picreso.oss-cn-beijing.aliyuncs.com/image-20201220164553273.png)\n\n   比如：[Leetcode 热题 Hot 100](https://leetcode-cn.com/problemset/leetcode-hot-100/) 和 [LeetCode 精选 TOP 面试题](https://leetcode-cn.com/problemset/leetcode-top/)\n\n2. 如果你**时间充裕**：可以按以下分类，系统练习：\n\n   + **专题一：数组(`Chapter1_Array`)**\n   + **专题二：链表(`Chapter2_list`)**\n   + **专题三：字符串(`Chapter3_String`)**\n   + **专题四：栈(`Chapter4_Stack`)**\n   + **专题五：树(`Chapter5_Tree`)**\n   + **专题六：排序(`Chapter6_Sort`)**\n   + **专题七：查找(`Chapter7_Search`)**\n   + **专题八：暴力解法(`Chapter8_Violence`)**\n   + **专题九：BFS(`Chapter9_BFS`)**\n   + **专题十：DFS(`Chapter10_DFS`)**\n   + **专题十一：分治(`Chapter11_Paritition`)**\n   + **专题十二：贪心(`Chapter12_Greedy`)**\n   + **专题十三：动态规划(`Chapter13_DP`)**\n   + **专题十四：图(`Chapter14_Graph`)**\n   + **专题十五：不定类型(`Chapter15_Unspecific`)**\n\n#### 练习策略\n\n+ **第一遍**：**先思考**，如果没思路，可以看题解，结合其他人的题解刷。总结自己是否在思路上有问题，或者是否算法与数据结构基础上有问题，掌握本题的类型，思考方式，最优题解。\n+ **第二遍**：**回忆最优解法**，**尝试直接写**，并与之前自己写过的解答作比对，总结问题和方法。\n+ **第三遍**：提升**刷题速度**和**一题多解**，拿出一个题，就能够知道其考察重点，解题方法，在短时间内写出解答，并且思考多种解决办法。\n\n","funding_links":[],"categories":["Java"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FXunzhuo%2FAlgorithm-Guide","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FXunzhuo%2FAlgorithm-Guide","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FXunzhuo%2FAlgorithm-Guide/lists"}