{"id":20613174,"url":"https://github.com/sherwinshen/leetcode","last_synced_at":"2026-04-17T08:33:14.310Z","repository":{"id":125493519,"uuid":"248689330","full_name":"sherwinshen/leetcode","owner":"sherwinshen","description":"📖 算法学习之 LeetCode（主要基于 TS/JS 语言）","archived":false,"fork":false,"pushed_at":"2022-06-04T11:12:22.000Z","size":361,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-06T18:31:48.185Z","etag":null,"topics":["algorithm","javascript","leetcode","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/sherwinshen.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":"2020-03-20T07:02:06.000Z","updated_at":"2024-08-11T08:51:09.000Z","dependencies_parsed_at":null,"dependency_job_id":"39686742-2318-4ff8-a834-93716ffa57fc","html_url":"https://github.com/sherwinshen/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sherwinshen/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sherwinshen%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sherwinshen%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sherwinshen%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sherwinshen%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sherwinshen","download_url":"https://codeload.github.com/sherwinshen/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sherwinshen%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31921980,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"online","status_checked_at":"2026-04-17T02:00:06.879Z","response_time":62,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["algorithm","javascript","leetcode","typescript"],"created_at":"2024-11-16T11:09:00.971Z","updated_at":"2026-04-17T08:33:14.304Z","avatar_url":"https://github.com/sherwinshen.png","language":"TypeScript","readme":"# LeetCode 算法题解\n\n\u003e 本项目主要包括 [Leetcode](https://leetcode-cn.com) 中算法题解（主要基于 TS/JS语言）以及常见算法的解题思路和框架。推荐阅读 👉 [fucking-algorithm](https://github.com/labuladong/fucking-algorithm)   \n\n# 1. 算法内容\n\n- 排序算法：快速排序、归并排序、计数排序\n- 搜索算法：回溯、递归、剪枝技巧\n- 图论：最短路、最小生成树、网络流建模\n- 动态规划：背包问题、最长子序列、计数问题\n- 基础技巧：分治、倍增、二分、贪心\n- [数据结构](./notes/data-structure.ts)：\n  - 数组与链表：单 / 双向链表\n  - 栈与队列\n  - 树与图：最近公共祖先、并查集\n  - 哈希表\n  - 堆：大 / 小根堆、可并堆\n  - 字符串：字典树、后缀树\n\n# 2. 算法基本操作\n\n数据结构的存储方式可以认为只有两种：**数组（顺序存储）和链表（链式存储）**，散列表、栈、队列、堆、树、图等均可以通过数组和链表来实现。那么算法呢，无非也就是针对数组和链表的增删改查，再简单说就是遍历+访问。\n\n## 2.1 数组遍历\n\n```js\nfunction traverse(array) {\n  for (let i = 0; i \u003c array.length; i++) {\n    // 访问array[i]   \n  }\n}\n```\n\n## 2.2 链表遍历\n\n```javascript\nclass ListNode {\n  constructor(val) {\n    this.val = val;\n    this.next = null;\n  }\n}\n\n// 迭代\nfunction traverse(head) {\n  for (let p = head; p != null; p = p.next) {\n    // 访问 p.val\n  }\n}\n\n// 递归\nfunction traverse(head) {\n  if (head !== null) {\n    // 访问 head.val\n    traverse(head.null)\n  }\n}\n```\n\n## 2.3 进阶遍历\n\n### 2.3.1 二叉树遍历 - 链表进化\n\n```javascript\nclass TreeNode(val) {\n  constructor(val) {\n    this.val = val;\n    this.left = null;\n    this.right = null;\n  }\n}\n\nfunction traverse(head) {\n  if(head !== null){\n    // 前序遍历 head.val\n    traverse(head.left)\n    // 中序遍历 head.val\n    traverse(head.right)\n    // 后序遍历 head.val\n  }\n}\n```\n\n### 2.3.2 N叉树遍历 - 二叉树进化\n\n```javascript\nclass TreeNode(val) {\n  constructor(val) {\n    this.val = val;\n    this.children = [];\n  }\n}\n\nfunction traverse(head) {\n  if(head !== null){\n    // 访问当前节点head.val\n    for(let i = 0; i \u003c head.children.length; i++){\n      traverse(this.head.children[i])\n    }\n  }\n}\n```\n\n# 3. 算法解题框架\n\n常见题型主要包括：二分查找、双指针、滑动窗口、广度优先搜索、深度优先搜索、回溯、递归、动态规划、位运算等\n\n## 3.1 常见解题框架\n\n- [动态规划解题框架](./notes/动态规划解题框架.md)\n- [深度/广度优先搜索算法解题框架](./notes/DFS和BFS解题框架.md) （深度优先搜索算法即回溯算法）\n- [二分查找解题框架](./notes/二分查找解题框架.md)\n- [滑动窗口解题框架](./notes/滑动窗口解题框架.md)\n- [双指针解题框架](./notes/双指针解题框架.md)\n- [排序算法](./notes/排序算法.md)\n- [位运算](./notes/位运算.md)\n\n## 3.2 常见解题思路\n\n### 3.2.1 分治\n\n分治主要分为三步走：分解 -\u003e 解决 -\u003e 合并\n\n1. 分解原问题为结构相同的子问题。\n2. 分解到某个容易求解的边界之后，进行第归求解。\n3. 将子问题的解合并成原问题的解。\n\n### 3.2.2 递归\n\n递归主要包括两部分内容：结束条件和自我调用，其中自我调用是在解决子问题，而结束条件定义了最简子问题的答案。\n\n```javascript\nfunction recursion(){\n  // 最简子问题，结束条件\n  // 自我调用，缩小规模\n}\n```\n\n------\n\n如果发现本项目有错误，欢迎提交 issues 或联系 [Sherwin](https://github.com/sherwinshen)。\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsherwinshen%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsherwinshen%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsherwinshen%2Fleetcode/lists"}