{"id":24628148,"url":"https://github.com/gavinbirkhoff/leetcode","last_synced_at":"2025-03-20T02:28:48.203Z","repository":{"id":143754787,"uuid":"477342038","full_name":"GavinBirkhoff/leetcode","owner":"GavinBirkhoff","description":"LeetCode刷题记录自己实现的多种方法以及整理官方解题方法✏️📒👣  尽可能不使用js现代方法，风格比较偏向c++，目的更接近算法本身，可能我觉得c++才更贴近数据结构和算法。","archived":false,"fork":false,"pushed_at":"2023-11-30T12:12:43.000Z","size":70,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-25T05:14:22.374Z","etag":null,"topics":["algorithms","leetcode","leetcode-javascript","leetcode-javascript-solutions"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/GavinBirkhoff.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,"governance":null}},"created_at":"2022-04-03T12:57:27.000Z","updated_at":"2023-10-10T13:45:37.000Z","dependencies_parsed_at":"2023-11-30T13:41:21.938Z","dependency_job_id":null,"html_url":"https://github.com/GavinBirkhoff/leetcode","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/GavinBirkhoff%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GavinBirkhoff%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GavinBirkhoff%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GavinBirkhoff%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GavinBirkhoff","download_url":"https://codeload.github.com/GavinBirkhoff/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244538161,"owners_count":20468665,"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","leetcode","leetcode-javascript","leetcode-javascript-solutions"],"created_at":"2025-01-25T05:14:24.626Z","updated_at":"2025-03-20T02:28:48.183Z","avatar_url":"https://github.com/GavinBirkhoff.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# JavaScript-Algorithms\n\nLeetCode算法题的JS解法✏️📒\n\n记录算法，在我们再次刷到相同题目时，可以帮助我们更好的探究当前的自己与以往的自己有多少进步👣\n\n我可能尽力不使用js现代方法，风格比较偏向c++，目的更接近算法本身，可能我觉得c++才更贴近数据结构和算法。\n\n## 栈与队列\n### 剑指Offer\n\n- [09. 用两个栈实现队列](./%E5%89%91%E6%8C%87Offer/30.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md)\n- [30. 包含min函数的栈](./%E5%89%91%E6%8C%87Offer/30.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.md)\n\n## 数组\n\n### 数据结构\n\n- [1. 两数之和](./数据结构/数组/1.%20两数之和.md)\n- [36. 有效的数独](./数据结构/数组/36.%20有效的数独.md)\n- [53. 最大子数组和](./%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/53.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E6%95%B0%E7%BB%84%E5%92%8C.md)\n- [73. 矩阵置零](./数据结构/数组/73.%20矩阵置零.md)\n- [88. 合并两个有序数组](./%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/88.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84.md)\n- [118. 杨辉三角](./%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/118.%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92.md)\n- [121. 买卖股票的最佳时机](./数据结构/数组/121.%20买卖股票的最佳时机.md)\n- [217. 存在重复元素](./%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/217.%20%E5%AD%98%E5%9C%A8%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0.md)\n- [350. 两个数组的交集 II](./数据结构/数组/350.%20两个数组的交集%20II.md)\n- [566. 重塑矩阵](./数据结构/数组/566.%20重塑矩阵.md)\n\n## 链表\n### 剑指Offer\n\n- [06. 从尾到头打印链表](./%E5%89%91%E6%8C%87Offer/06.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.md)\n- [24. 反转链表](./%E5%89%91%E6%8C%87Offer/24.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.md)\n- [35. 复杂链表的复制](./%E5%89%91%E6%8C%87Offer/35.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6.md)\n\n### 数据结构\n\n- [21. 合并两个有序链表](./数据结构/链表/21.%20合并两个有序链表.md)\n- [141. 环形链表](./数据结构/链表/141.%20环形链表.md)\n- [203. 移除链表元素](./数据结构/链表/203.%20移除链表元素.md)\n\n## 字符串\n\n### 剑指Offer\n\n- [05. 替换空格](./%E5%89%91%E6%8C%87Offer/05.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC.md)\n- [58 - II. 左旋转字符串](./%E5%89%91%E6%8C%87Offer/58%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2.md)\n\n### 数据结构\n\n- [125. 验证回文串](./数据结构/字符串/125.%20验证回文串.md)\n- [242. 有效的字母异位词](./数据结构/字符串/242.%20有效的字母异位词.md)\n- [383. 赎金信](./数据结构/字符串/383.%20赎金信.md)\n- [387. 字符串中的第一个唯一字符](./数据结构/字符串/387.%20字符串中的第一个唯一字符.md)\n\n## 查找算法\n\n**Note:**\n二分查找在奇数面下会出现left=right，在偶数面最低位有可能出现left=right\n\n### 剑指Offer\n\n- [03. 数组中重复的数字](./%E5%89%91%E6%8C%87Offer/03.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97.md)\n- [04. 二维数组中的查找](./%E5%89%91%E6%8C%87Offer/04.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.md)\n- [11. 旋转数组的最小数字](./%E5%89%91%E6%8C%87Offer/11.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.md)\n- [50. 第一个只出现一次的字符](./%E5%89%91%E6%8C%87Offer/50.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.md)\n- [53 - I. 在排序数组中查找数字 I](./%E5%89%91%E6%8C%87Offer/53%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I.md)\n- [53 - II. 0～n-1中缺失的数字](./%E5%89%91%E6%8C%87Offer/53%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97.md)\n\n## 搜索与回溯算法\n\n### 剑指Offer\n\n- [26. 树的子结构](./%E5%89%91%E6%8C%87Offer/26.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84.md)\n- [27. 二叉树的镜像](./%E5%89%91%E6%8C%87Offer/27.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F.md)\n- [28. 对称的二叉树](./%E5%89%91%E6%8C%87Offer/28.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n- [32 - I. 从上到下打印二叉树](./%E5%89%91%E6%8C%87Offer/32%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.md)\n- [32 - II. 从上到下打印二叉树 II](./%E5%89%91%E6%8C%87Offer/32%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II.md)\n- [32 - III. 从上到下打印二叉树 III](./%E5%89%91%E6%8C%87Offer/32%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III.md)\n\n## 动态规划\n\n### 剑指Offer\n\n- [10- I. 斐波那契数列](./%E5%89%91%E6%8C%87Offer/10-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97.md)\n- [10- II. 青蛙跳台阶问题](./剑指Offer/10-%20II.%20青蛙跳台阶问题.md)\n- [42. 连续子数组的最大和](./剑指Offer/42.%20连续子数组的最大和.md)\n- [46. 把数字翻译成字符串](./剑指Offer/46.%20把数字翻译成字符串.md)\n- [47. 礼物的最大价值](./剑指Offer/47.%20礼物的最大价值.md)\n\n# LeetCode75\n\n- [1768. 交替合并字符串](./LeetCode75/1768.%20%E4%BA%A4%E6%9B%BF%E5%90%88%E5%B9%B6%E5%AD%97%E7%AC%A6%E4%B8%B2.md)\n\n# 每日一题\n\n- [2578. 最小和分割](./2578.%20最小和分割.md)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgavinbirkhoff%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgavinbirkhoff%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgavinbirkhoff%2Fleetcode/lists"}