{"id":18433509,"url":"https://github.com/loveincode/data-structures-and-algorithms","last_synced_at":"2025-04-07T19:31:32.464Z","repository":{"id":94707933,"uuid":"98642781","full_name":"loveincode/Data-structures-and-algorithms","owner":"loveincode","description":"🦄 Java data structure and sorting algorithm","archived":false,"fork":false,"pushed_at":"2019-08-31T08:48:56.000Z","size":731,"stargazers_count":6,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-22T23:04:08.364Z","etag":null,"topics":["algorithm","datastructures"],"latest_commit_sha":null,"homepage":"","language":"Java","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/loveincode.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":"2017-07-28T11:21:53.000Z","updated_at":"2024-05-11T03:30:27.000Z","dependencies_parsed_at":"2023-04-04T14:15:45.833Z","dependency_job_id":null,"html_url":"https://github.com/loveincode/Data-structures-and-algorithms","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/loveincode%2FData-structures-and-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/loveincode%2FData-structures-and-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/loveincode%2FData-structures-and-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/loveincode%2FData-structures-and-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/loveincode","download_url":"https://codeload.github.com/loveincode/Data-structures-and-algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247716279,"owners_count":20984211,"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","datastructures"],"created_at":"2024-11-06T05:34:45.561Z","updated_at":"2025-04-07T19:31:32.458Z","avatar_url":"https://github.com/loveincode.png","language":"Java","readme":"## Data-structures-and-algorithms\n### 数据结构与排序算法基础\n\n数据结构：数组，链表，哈希表，堆，队列，栈，二叉树，B树/B+树，红黑树，图(研发 图不多)\n\n常见的排序算法(冒泡，插入，快排，堆排，归并排序…)\n\n简单的动态规划问题(背包，上楼梯)\n\n各种时间空间复杂度分析\n\n所含知识点：\n\n* 1 字符串\n\n    查找匹配 KMP 正则\n\n* 2 数组\n\n* 3 链表\n\n* 4 栈   \n    java.util.Stack 实现\n    ```java\n    //取栈顶值（不出栈）\n    stack.peek();\n    //进栈\n    stack.push(Object);\n    //出栈\n    stack.pop();\n    ```\n    \n* 5 队列 \n    java.util.Queue 接口\n    \n```java\n\n    add         增加一个元索                     如果队列已满，则抛出一个IIIegaISlabEepeplian异常\n　　remove   移除并返回队列头部的元素    如果队列为空，则抛出一个NoSuchElementException异常\n　　element  返回队列头部的元素             如果队列为空，则抛出一个NoSuchElementException异常\n　　offer       添加一个元素并返回true       如果队列已满，则返回false\n　　poll         移除并返问队列头部的元素    如果队列为空，则返回null\n　　peek       返回队列头部的元素             如果队列为空，则返回null\n　　put         添加一个元素                      如果队列满，则阻塞\n　　take        移除并返回队列头部的元素     如果队列为空，则阻塞\n\n```\n\n* 6 树\n\n    二叉树 [二叉树实现 及三种遍历](https://github.com/loveincode/Data-structures-and-algorithms/blob/master/src/data_structures/data06_tree/Binarytree/BinaryTree.java)\n    \n    ``` \n    前序遍历 根左右\n    中序遍历 左根右\n    后序遍历 左右根\n    ```\n    B Tree / B+ Tree\n\n    红黑树\n\n* 7 哈希\n\n    哈希冲突 k-v\n\n* 8 图\n\n    BFS\n    DFS [BFS和DFS优先搜索算法](http://www.cnblogs.com/pengyingh/articles/2396432.html)\n\n* 9 排序\n\n    插入排序（直接插入排序、希尔排序）\n    \n    选择排序（简单选择排序、堆排序）\n    \n    交换排序（冒泡排序、快速排序）\n    \n    归并排序\n\n    基数排序\n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Floveincode%2Fdata-structures-and-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Floveincode%2Fdata-structures-and-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Floveincode%2Fdata-structures-and-algorithms/lists"}