{"id":20238785,"url":"https://github.com/geekhyt/javascript-leetcode","last_synced_at":"2025-06-26T07:31:52.351Z","repository":{"id":52994882,"uuid":"242749571","full_name":"Geekhyt/javascript-leetcode","owner":"Geekhyt","description":"LeetCode 题解仓库🍖","archived":false,"fork":false,"pushed_at":"2022-03-04T01:20:41.000Z","size":225,"stargazers_count":135,"open_issues_count":95,"forks_count":23,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-04-10T19:58:03.578Z","etag":null,"topics":["blog","fe","interview","javascript","leetcode-javascript","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":null,"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/Geekhyt.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":"2020-02-24T13:55:30.000Z","updated_at":"2025-04-09T07:02:54.000Z","dependencies_parsed_at":"2022-09-08T00:41:05.488Z","dependency_job_id":null,"html_url":"https://github.com/Geekhyt/javascript-leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Geekhyt/javascript-leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Geekhyt%2Fjavascript-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Geekhyt%2Fjavascript-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Geekhyt%2Fjavascript-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Geekhyt%2Fjavascript-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Geekhyt","download_url":"https://codeload.github.com/Geekhyt/javascript-leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Geekhyt%2Fjavascript-leetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262022057,"owners_count":23246247,"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":["blog","fe","interview","javascript","leetcode-javascript","leetcode-solutions"],"created_at":"2024-11-14T08:35:40.430Z","updated_at":"2025-06-26T07:31:52.326Z","avatar_url":"https://github.com/Geekhyt.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"## 前端食堂的 LeetCode 题解仓库\n\n[![](https://img.shields.io/badge/WeChat-微信群-brightgreen)](#交流)\n[![](https://img.shields.io/badge/公众号-前端食堂-blueviolet)](#交流)\n[![](https://img.shields.io/badge/Juejin-掘金-blue)](https://juejin.im/user/5a2de8a8f265da4320032fc4)\n[![](https://img.shields.io/badge/Weibo-微博-orange)](https://weibo.com/u/2771284557)\n[![](https://img.shields.io/badge/Zhihu-知乎-blue)](https://www.zhihu.com/people/huo-yi-tong-98)\n[![](https://img.shields.io/badge/bilili-哔哩哔哩-ff69b4)](https://space.bilibili.com/161753278)\n\n2021 年计划，这个仓库写满 100 篇前端面试高频 LeetCode 题解(JavaScript)。\n\n题目序号为 LeetCode 对应题目的序号，题解内有链接跳转到对应题目。\n\n如果你是初学者，可能你需要一份数据结构与算法的入门资料，我之前写过一些文章，如下：\n\n- [前端如何搞定数据结构与算法(先导篇)](https://juejin.im/post/5e9bb8c251882573820998ac)\n- [JavaScript 算法时间、空间复杂度分析](https://juejin.im/post/5ea979085188256d6f267940)\n- [你真的懂递归吗？](https://juejin.im/post/5ec225e26fb9a043761ce4d8)\n- [分治、动态规划、回溯、贪心一锅炖](https://juejin.im/post/5ee4f5bfe51d457b3f4a1fc0#heading-22)\n- [数组回炉重造+6道前端算法面试高频题解](https://juejin.cn/post/6937526265201033230/)\n- [面试链表不再怕](https://juejin.im/post/5f09ede5f265da22eb2a6dcf)\n- [“树”业有专攻](https://juejin.im/post/5ef32453f265da22ef7daad3#heading-14)\n- [从酒桌游戏看二分查找算法](https://juejin.im/post/5f0499c76fb9a07e976bdbc2)\n- [食堂店小二儿教你学会栈](https://juejin.im/post/6869785753958907912)\n- [前端玩转位运算(N皇后+Vue3位运算应用)](https://juejin.cn/post/6904595258915422215/)\n- [手撕前端面试之经典排序算法 (动图+视频)](https://juejin.cn/post/6932482325159067656)\n\n感谢 Star🌟\n\n## 进度\n\n已经完成 100 道。\n\n## 数组\n\n- [1. 两数之和](https://github.com/Geekhyt/javascript-leetcode/issues/1)\n- [剑指 Offer 03. 数组中重复的数字](https://github.com/Geekhyt/javascript-leetcode/issues/60)\n- [11. 盛水最多的容器](https://github.com/Geekhyt/javascript-leetcode/issues/2)\n- [15. 三数之和](https://github.com/Geekhyt/javascript-leetcode/issues/3)\n- [26. 删除排序数组中的重复项](https://github.com/Geekhyt/javascript-leetcode/issues/4)\n- [27. 移除元素](https://github.com/Geekhyt/javascript-leetcode/issues/67)\n- [66. 加一 ](https://github.com/Geekhyt/javascript-leetcode/issues/5)\n- [88. 合并两个有序数组](https://github.com/Geekhyt/javascript-leetcode/issues/72)\n- [169. 多数元素](https://github.com/Geekhyt/javascript-leetcode/issues/68)\n- [283. 移动零 ](https://github.com/Geekhyt/javascript-leetcode/issues/6)\n- [349. 两个数组的交集](https://github.com/Geekhyt/javascript-leetcode/issues/69)\n- [217. 存在重复元素](https://github.com/Geekhyt/javascript-leetcode/issues/88)\n\n\n## 链表\n\n- [19. 删除链表的倒数第 N 个结点](https://github.com/Geekhyt/javascript-leetcode/issues/12)\n- [21. 合并两个有序链表](https://github.com/Geekhyt/javascript-leetcode/issues/7)\n- [24. 两两交换链表中的节点](https://github.com/Geekhyt/javascript-leetcode/issues/8)\n- [141. 环形链表](https://github.com/Geekhyt/javascript-leetcode/issues/9)\n- [206. 反转链表](https://github.com/Geekhyt/javascript-leetcode/issues/10)\n- [876. 链表的中间结点](https://github.com/Geekhyt/javascript-leetcode/issues/11)\n- [160. 相交链表](https://github.com/Geekhyt/javascript-leetcode/issues/61)\n- [25. K 个一组翻转链表](https://github.com/Geekhyt/javascript-leetcode/issues/62)\n- [83. 删除排序链表中的重复元素](https://github.com/Geekhyt/javascript-leetcode/issues/63)\n- [剑指 Offer 06. 从尾到头打印链表](https://github.com/Geekhyt/javascript-leetcode/issues/65)\n- [面试题 02.02. 返回倒数第 k 个节点](https://github.com/Geekhyt/javascript-leetcode/issues/66)\n\n## 树\n\n- [94. 二叉树的中序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/13)\n- [98. 验证二叉搜索树](https://github.com/Geekhyt/javascript-leetcode/issues/75)\n- [100. 相同的树](https://github.com/Geekhyt/javascript-leetcode/issues/16)\n- [101. 对称二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/17)\n- [102. 二叉树的层序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/18)\n- [104. 二叉树的最大深度](https://github.com/Geekhyt/javascript-leetcode/issues/19)\n- [110. 平衡二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/76)\n- [108. 将有序数组转换为二叉搜索树](https://github.com/Geekhyt/javascript-leetcode/issues/79)\n- [112. 路径总和](https://github.com/Geekhyt/javascript-leetcode/issues/77)\n- [144. 二叉树的前序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/14)\n- [145. 二叉树的后序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/15)\n- [226. 翻转二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/20)\n- [543. 二叉树的直径](https://github.com/Geekhyt/javascript-leetcode/issues/78)\n- [617. 合并二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/87)\n- [429. N 叉树的层序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/89)\n- [590. N 叉树的后序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/90)\n- [589. N 叉树的前序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/91)\n- [111. 二叉树的最小深度](https://github.com/Geekhyt/javascript-leetcode/issues/92)\n- [236. 二叉树的最近公共祖先](https://github.com/Geekhyt/javascript-leetcode/issues/93)\n- [297. 二叉树的序列化与反序列化](https://github.com/Geekhyt/javascript-leetcode/issues/94)\n\n\n## 栈\n\n- [20. 有效的括号](https://github.com/Geekhyt/javascript-leetcode/issues/21)\n- [84. 柱状图中最大的矩形](https://github.com/Geekhyt/javascript-leetcode/issues/22)\n- [155. 最小栈](https://github.com/Geekhyt/javascript-leetcode/issues/23)\n- [739. 每日温度](https://github.com/Geekhyt/javascript-leetcode/issues/73)\n- [1047. 删除字符串中的所有相邻重复项](https://github.com/Geekhyt/javascript-leetcode/issues/80)\n\n## 队列\n\n- [239. 滑动窗口最大值](https://github.com/Geekhyt/javascript-leetcode/issues/95)\n\n## 贪心\n\n- [55. 跳跃游戏](https://github.com/Geekhyt/javascript-leetcode/issues/24)\n- [455. 分发饼干](https://github.com/Geekhyt/javascript-leetcode/issues/25)\n- [860. 柠檬水找零](https://github.com/Geekhyt/javascript-leetcode/issues/26)\n\n## 回溯\n- [17. 电话号码的字母组合](https://github.com/Geekhyt/javascript-leetcode/issues/27)\n- [46. 全排列](https://github.com/Geekhyt/javascript-leetcode/issues/28)\n- [47. 全排列 II](https://github.com/Geekhyt/javascript-leetcode/issues/32)\n- [22. 括号生成](https://github.com/Geekhyt/javascript-leetcode/issues/29)\n- [39. 组合总和](https://github.com/Geekhyt/javascript-leetcode/issues/30)\n- [40. 组合总和 II](https://github.com/Geekhyt/javascript-leetcode/issues/31)\n- [77. 组合](https://github.com/Geekhyt/javascript-leetcode/issues/33)\n- [78. 子集](https://github.com/Geekhyt/javascript-leetcode/issues/34)\n\n## 字符串\n- [125. 验证回文串](https://github.com/Geekhyt/javascript-leetcode/issues/35)\n- [344. 反转字符串](https://github.com/Geekhyt/javascript-leetcode/issues/36)\n- [415. 字符串相加](https://github.com/Geekhyt/javascript-leetcode/issues/37)\n- [58. 最后一个单词的长度](https://github.com/Geekhyt/javascript-leetcode/issues/74)\n- [409. 最长回文串](https://github.com/Geekhyt/javascript-leetcode/issues/81)\n\n## 排序\n- [冒泡排序](https://github.com/Geekhyt/javascript-leetcode/issues/39)\n- [插入排序](https://github.com/Geekhyt/javascript-leetcode/issues/40)\n- [选择排序](https://github.com/Geekhyt/javascript-leetcode/issues/41)\n- [归并排序](https://github.com/Geekhyt/javascript-leetcode/issues/42)\n- [快速排序](https://github.com/Geekhyt/javascript-leetcode/issues/43)\n- [堆排序](https://github.com/Geekhyt/javascript-leetcode/issues/44)\n- [剑指 Offer 40. 最小的k个数](https://github.com/Geekhyt/javascript-leetcode/issues/82)\n\n## DFS\n\n- [200. 岛屿数量](https://github.com/Geekhyt/javascript-leetcode/issues/64)\n\n## LRU\n\n- [146. LRU 缓存机制](https://github.com/Geekhyt/javascript-leetcode/issues/86)\n\n## 位运算\n\n- [136. 只出现一次的数字](https://github.com/Geekhyt/javascript-leetcode/issues/83)\n- [52. N皇后 II](https://github.com/Geekhyt/javascript-leetcode/issues/84)\n\n## 二分查找\n- [704. 二分查找](https://github.com/Geekhyt/javascript-leetcode/issues/85)\n- [33. 搜索旋转排序数组](https://github.com/Geekhyt/javascript-leetcode/issues/70)\n- [35. 搜索插入位置](https://github.com/Geekhyt/javascript-leetcode/issues/71)\n\n## 动态规划\n- [70. 爬楼梯](https://github.com/Geekhyt/javascript-leetcode/issues/38)\n- [一口气团灭 6 道股票算法](https://github.com/Geekhyt/javascript-leetcode/issues/45)\n  - 121.买卖股票的最佳时机\n  - 122.买卖股票的最佳时机 II\n  - 123.买卖股票的最佳时机 III\n  - 188.买卖股票的最佳时机 IV\n  - 309.最佳买卖股票时机含冷冻期\n  - 714.买卖股票的最佳时机含手续费\n- [198. 打家劫舍](https://github.com/Geekhyt/javascript-leetcode/issues/46)\n- [5. 最长回文子串](https://github.com/Geekhyt/javascript-leetcode/issues/47)\n- [53. 最大子序和](https://github.com/Geekhyt/javascript-leetcode/issues/48)\n- [300. 最长递增子序列](https://github.com/Geekhyt/javascript-leetcode/issues/49)\n- [32. 最长有效括号](https://github.com/Geekhyt/javascript-leetcode/issues/50)\n- [64. 最小路径和](https://github.com/Geekhyt/javascript-leetcode/issues/51)\n- [62. 不同路径](https://github.com/Geekhyt/javascript-leetcode/issues/52)\n- [221. 最大正方形](https://github.com/Geekhyt/javascript-leetcode/issues/53)\n- [72. 编辑距离](https://github.com/Geekhyt/javascript-leetcode/issues/54)\n- [322. 零钱兑换](https://github.com/Geekhyt/javascript-leetcode/issues/55)\n- [剑指 Offer 42. 连续子数组的最大和](https://github.com/Geekhyt/javascript-leetcode/issues/56)\n- [139. 单词拆分](https://github.com/Geekhyt/javascript-leetcode/issues/57)\n- [887. 鸡蛋掉落](https://github.com/Geekhyt/javascript-leetcode/issues/58)\n- [279. 完全平方数](https://github.com/Geekhyt/javascript-leetcode/issues/59)\n\n\n## 交流\n\n加我微信: hungryturbo 备注「加群」即可。\n\n![](https://github.com/Geekhyt/front-end-canteen/blob/master/images/new-qrcode.jpg)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeekhyt%2Fjavascript-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgeekhyt%2Fjavascript-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgeekhyt%2Fjavascript-leetcode/lists"}