{"id":13691767,"url":"https://github.com/yezihack/algo","last_synced_at":"2026-02-13T19:25:46.258Z","repository":{"id":50575205,"uuid":"163421282","full_name":"yezihack/algo","owner":"yezihack","description":"数据结构与算法 by golang","archived":false,"fork":false,"pushed_at":"2020-08-16T14:33:26.000Z","size":970,"stargazers_count":236,"open_issues_count":3,"forks_count":87,"subscribers_count":15,"default_branch":"master","last_synced_at":"2024-11-12T17:47:37.958Z","etag":null,"topics":["algorithms","algs","data-struct"],"latest_commit_sha":null,"homepage":"","language":"Go","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/yezihack.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}},"created_at":"2018-12-28T14:54:47.000Z","updated_at":"2024-09-20T10:50:18.000Z","dependencies_parsed_at":"2022-09-13T17:20:38.497Z","dependency_job_id":null,"html_url":"https://github.com/yezihack/algo","commit_stats":null,"previous_names":["yezihack/studyalg"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yezihack%2Falgo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yezihack%2Falgo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yezihack%2Falgo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yezihack%2Falgo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yezihack","download_url":"https://codeload.github.com/yezihack/algo/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252063140,"owners_count":21688655,"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":["algorithms","algs","data-struct"],"created_at":"2024-08-02T17:00:50.215Z","updated_at":"2026-02-13T19:25:41.215Z","avatar_url":"https://github.com/yezihack.png","language":"Go","funding_links":[],"categories":["文档","Documentation"],"sub_categories":["组织","To Organize"],"readme":"[![GitHub stars](https://img.shields.io/github/stars/yezihack/algo?style=flat-square)](https://github.com/yezihack/algo/stargazers)\n[![GitHub forks](https://img.shields.io/github/forks/yezihack/algo)](https://github.com/yezihack/algo/network)\n\n**脑图分享,之前失效的URL, 请查看这个:[脑图笔记](https://mubu.com/doc/2ZN7M-lA91C),因手贱被我重置啦,抱歉.**\n\n# 学习算法,终生学习.\n\u003e 算法本质是使程序片段执行得到一种最优最快的方法,\n从而实现计算量最少最优,CPU占用最低,响应最快的结果.\n\n## 实战算法\n\u003e 提供golang,php,c语言及多种解法实现.详细每一个步骤 \n1. [https://github.com/yezihack/leetcode](https://github.com/yezihack/leetcode)\n\n## 图解算法\n[https://visualgo.net/](https://visualgo.net/)\n\n## 数据结构图谱\n![](https://mubu.com/document_image/b0d5dd17-e131-4de9-9149-0c752e4c76c7-2746950.jpg)\n\n\n## 算法好坏基本判断\n1. 时间复杂度,使用大O表示法.如O(1), O(n), O(LogN)\n1. 空间复杂度.\n\n## 如何分析算法题\n1. 找到数据之间的规律,得出通用公式\n1. 将大问题不断缩小范围,得到一个最小范围解\n1. 借用空间换时间.\n\n\n## 蓝蝙蝠算法系列\n1. [数组转换成最小值](24.蓝蝙蝠面试算法/01.数组转换成最小值.go)\n\n## 排序\n1. [冒泡排序](16.排序算法/03.冒泡排序.go)\n1. [插入排序](16.排序算法/01.插入排序.go)\n1. [选择排序](16.排序算法/05.简单选择排序.go)\n1. [希尔排序](16.排序算法/02.希尔排序.go)\n1. [归并排序](16.排序算法/08.归并排序.go)\n1. [快速排序](16.排序算法/04.快速排序.go)\n### 排序的总结\n![](assets/sort.jpg)\n\n## 列表\n1. [斐波那契数列](fibonacci/main.go) chan实现\n1. [二分法实现](dichotomy/demo.go) 多种写法\n1. [双链表实现](DoubleLinedList/README.md) 并发安全\n1. [FIFO先进先出算法实现](Cache/README.md) 双链表实现\n1. [LRU最少最近算法实现](Cache/README.md) 双链表实现\n1. [LFU最不常用算法实现](Cache/README.md) 双链表实现\n\n## 树\n1. [基本定义与概念](tree/README.md)\n1. [二叉树基本操作](tree/binary_tree.go)\n1. [哈夫曼树](tree/huffman_tree.go)\n\n## 贪心思想\n1. [非负整数a,删除k个元素,求最大值](21.贪心思想/01.求最大值.go)\n\n## 动态规划\n1 [最长公共子串](23.动态规划/02.最长公共子串.go)\n1 [最长公共子序列](23.动态规划/03.公共子序列.go)\n\n## 递归题\n1. [顺时针打印矩阵](01.递归算法/07.顺时针打印矩阵.go)\n\n## 各种算法已代码实现\n1. 极客时间算法: https://github.com/wangzheng0822/algo\n\n## Common Data Structure Operations\n1. http://www.bigocheatsheet.com/\n\n### 时间复杂度\n![](assets/Oalgo.png)\n\n## 学习笔记\n1. [王卓老师的\u003c\u003c数据结构与算法\u003e\u003e](https://www.bilibili.com/read/cv3285768)\n1. [脑图笔记](https://mubu.com/doc/2ZN7M-lA91C) \n1. [代码实现](https://github.com/yezihack/algo)\n3. 仅供同学们参考\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyezihack%2Falgo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyezihack%2Falgo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyezihack%2Falgo/lists"}