{"id":16796720,"url":"https://github.com/ecmadao/algorithms","last_synced_at":"2025-07-20T15:03:21.745Z","repository":{"id":65622809,"uuid":"101315166","full_name":"ecmadao/algorithms","owner":"ecmadao","description":"Algorithms notes \u0026 LeetCode/Codewars solutions by Node.js, Swift and Haskell","archived":false,"fork":false,"pushed_at":"2022-07-12T04:04:13.000Z","size":4203,"stargazers_count":102,"open_issues_count":3,"forks_count":71,"subscribers_count":9,"default_branch":"master","last_synced_at":"2025-04-02T03:01:42.354Z","etag":null,"topics":["algorithm","algorithms","algorithms-coursera","nodejs","tree"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/ecmadao.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":"2017-08-24T16:20:08.000Z","updated_at":"2024-11-06T20:43:55.000Z","dependencies_parsed_at":"2023-02-01T08:31:02.448Z","dependency_job_id":null,"html_url":"https://github.com/ecmadao/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ecmadao/algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ecmadao%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ecmadao%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ecmadao%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ecmadao%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ecmadao","download_url":"https://codeload.github.com/ecmadao/algorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ecmadao%2Falgorithms/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266143941,"owners_count":23883069,"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-coursera","nodejs","tree"],"created_at":"2024-10-13T09:19:52.306Z","updated_at":"2025-07-20T15:03:21.714Z","avatar_url":"https://github.com/ecmadao.png","language":"JavaScript","readme":"\u003c!-- START doctoc generated TOC please keep comment here to allow auto update --\u003e\n\u003c!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN doctoc TO UPDATE --\u003e\n**Table of Contents**  *generated with [DocToc](https://github.com/thlorenz/doctoc)*\n\n- [Algorithms](#algorithms)\n  - [预储备](#%E9%A2%84%E5%82%A8%E5%A4%87)\n  - [Topic](#topic)\n  - [LeetCode](#leetcode)\n  - [Run demo](#run-demo)\n\n\u003c!-- END doctoc generated TOC please keep comment here to allow auto update --\u003e\n\n## Algorithms\n\n\u003e 在设计算法时，面对的第一个任务是精准地定义问题。\n\nAlgorithms notes \u0026 code \u0026 leetcode solution by Node.js, Swift, Haskell and C#.\n\n### 预储备\n\n[基本数据结构](./data-structure.md)：\n\n- 堆/栈\n- 链表\n- 映射\n- 散列\n- 二叉树\n- 图\n\n### Topic\n\n- [并查集](./union-find)\n- [基本排序](./elementary-sorts)\n- [归并排序](./mergesort)\n- [快速排序](./quicksort)\n- [优先队列](./priority-queues)\n- [二叉搜索树](./binary-search-trees)\n- 平衡二叉搜索树\n  - [AVL 二叉搜索树](./balanced-search-trees)\n  - [2-3 二叉搜索树](./2-3-search-trees)\n  - [红黑二叉搜索树](./red-black-bsts)\n  - [区间二叉搜索树](./interval-search-trees)\n- [k-d 树](./k-d-trees)\n- [排列组合](./permutation-and-combination)\n- [图](./graph)\n- [数字转换](./number)\n- [跳跃链表](./skiplist)\n\n### [LeetCode](./leetcode)\n\n### Run demo\n\nJavaScript：\n\n- Version \u003e= 7.0.0\n- 如果 Node 版本较低，则可以自行选择使用 Babel 进行转换\n- Leetcode 题解代码直接在浏览器中即可运行（ES5/ES6 语法）\n- 直接运行各个文件夹下的 `js` 文件即可查看算法运行的结果，例如在项目根目录下 `node ./priority-queues/binary-heaps.js`\n\nSwift：\n\n- Version \u003e= 4.0\n\nHaskell:\n\n- Version \u003e= 8.4.3\n- Using GHCi and load `.hs` files\n\nRuby:\n\n- Version \u003e= 2.4.1\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fecmadao%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fecmadao%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fecmadao%2Falgorithms/lists"}