{"id":16157958,"url":"https://github.com/can-dy-jack/algorithm","last_synced_at":"2026-03-18T18:08:36.649Z","repository":{"id":65343183,"uuid":"439577545","full_name":"can-dy-jack/algorithm","owner":"can-dy-jack","description":"JavaScript算法与数据结构库","archived":false,"fork":false,"pushed_at":"2023-01-18T06:58:18.000Z","size":867,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-22T22:53:55.607Z","etag":null,"topics":["algorithms","data-structures","double-linked-list","heap","linked-list","priority-queue","queue","stack"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/can-dy-jack.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}},"created_at":"2021-12-18T09:40:31.000Z","updated_at":"2023-03-07T03:47:14.000Z","dependencies_parsed_at":"2023-02-10T13:30:39.887Z","dependency_job_id":null,"html_url":"https://github.com/can-dy-jack/algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/can-dy-jack/algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/can-dy-jack%2Falgorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/can-dy-jack%2Falgorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/can-dy-jack%2Falgorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/can-dy-jack%2Falgorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/can-dy-jack","download_url":"https://codeload.github.com/can-dy-jack/algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/can-dy-jack%2Falgorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29158076,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-06T07:18:23.844Z","status":"ssl_error","status_checked_at":"2026-02-06T07:13:32.659Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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","data-structures","double-linked-list","heap","linked-list","priority-queue","queue","stack"],"created_at":"2024-10-10T01:51:38.348Z","updated_at":"2026-02-06T10:36:28.605Z","avatar_url":"https://github.com/can-dy-jack.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# JavaScript算法与数据结构库\n\n## 数据结构\n\n- 单向链表/双向链表：[LinkedList / DoubleLinkedList](https://github.com/can-dy-jack/linkedlist)\n    - *循环链表 - 最后一个结点的指针域指向头结点，整个链表形成一个环*\n- 堆: [MaxHeap / MinHeap](https://github.com/can-dy-jack/heap)\n    - 堆排序：[maxHeapSort / minHeapSort](https://github.com/can-dy-jack/heap)\n    - Top K 大：\n        - 最大堆解决  =\u003e 最小堆解决 \n    - Top K 小：\n        - 最小堆解决  =\u003e 最大堆解决\n- 优先队列： [PriorityQueue](https://github.com/can-dy-jack/priority-queue)\n- 栈： [Stack](https://github.com/can-dy-jack/stack)\n- 队列： [Queue](https://github.com/can-dy-jack/queue)\n\n### npm\njavascript data structure repository.  \njs数据结构集成库。\n\n\u003e sum up all data structures of @kartjim into a single repository.\n\n```sh\nnpm i structure-extend\n```\nor use yarn\n```sh\nyarn add structure-extend\n```\n#### import\n\n```js\nconst {\n    Queue,\n    Stack,\n    MaxHeap,\n    MinHeap,\n    minHeapSort,\n    maxHeapSort,\n    PriorityQueue,\n    LinkedList,\n    DoubleLinkedList,\n    LinkedListNode,\n    DoubleLinkedListNode\n} = require('structure-extend')\n```\nor use ESM：\n```js\nimport {\n    Queue,\n    Stack,\n    MaxHeap,\n    MinHeap,\n    minHeapSort,\n    maxHeapSort,\n    PriorityQueue,\n    LinkedList,\n    DoubleLinkedList,\n    LinkedListNode,\n    DoubleLinkedListNode,\n} from 'structure-extend';\n```\n\n## 算法 计划中~\n数组相关、字符串相关、双指针、滑动窗口、二分、位运算、DFS、BFS、回溯、字典树、前缀树、并查集、线段树、树状数组、记忆化搜索、分治、DP、贪心、图论、数论。。。\n\n数组相关：\n- 前缀和\n- 差分\n\n\u003c!-- 一维前缀，二维前缀； https://leetcode.cn/problems/range-sum-query-2d-immutable/\n  一维差分，二维差分； 二维差分主要是用于快速将一个区块中的所有元素都加上 。https://leetcode.cn/problems/increment-submatrices-by-one/ --\u003e\n\n\u003c!-- KMP --\u003e\n\n\u003c!-- 算法仓库：二分查找\\KMP算法\\... -\u003e 不做成代码库，写成文档库也行 --\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcan-dy-jack%2Falgorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcan-dy-jack%2Falgorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcan-dy-jack%2Falgorithm/lists"}