{"id":19463068,"url":"https://github.com/poppinlp/leetcode","last_synced_at":"2025-10-22T21:35:56.593Z","repository":{"id":55559630,"uuid":"201608629","full_name":"poppinlp/leetcode","owner":"poppinlp","description":"Easy understand JS solutions for problems on leetcode which beats 90% at least.","archived":false,"fork":false,"pushed_at":"2022-03-20T09:04:42.000Z","size":44732,"stargazers_count":26,"open_issues_count":0,"forks_count":8,"subscribers_count":4,"default_branch":"master","last_synced_at":"2024-04-14T05:59:40.525Z","etag":null,"topics":["algorithm","contest","interview","javascript","leetcode"],"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/poppinlp.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":"2019-08-10T09:26:44.000Z","updated_at":"2024-02-25T08:46:15.000Z","dependencies_parsed_at":"2022-08-15T03:10:49.738Z","dependency_job_id":null,"html_url":"https://github.com/poppinlp/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/poppinlp%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/poppinlp%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/poppinlp%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/poppinlp%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/poppinlp","download_url":"https://codeload.github.com/poppinlp/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":223992700,"owners_count":17237501,"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","contest","interview","javascript","leetcode"],"created_at":"2024-11-10T18:08:09.108Z","updated_at":"2025-10-22T21:35:56.499Z","avatar_url":"https://github.com/poppinlp.png","language":"JavaScript","readme":"# 宝宝也能看懂的 LEETCODE 题解\n\nHi 大家好，我是张小猪。欢迎来到『宝宝也能看懂』系列之 leetcode 题解。\n\n什么？你不是宝宝？哼，不管不管 \u003e.\u003c\n\n## 亮点\n\n- 详细解释，通俗易懂\n- 包含思路或优化过程\n- 基于每周比赛、专题分类和标签\n- 代码基于 JS ES2015+ 实现\n- 性能 beats 90% 以上\n- 不包含订阅才能解锁的题目（其实就是我没订阅 T_T\n\n## 关于本猪\n\n本小猪非算法大佬，所以可能并不是最优解。不过从提交后运行耗时来看，应该不算太差。  \n如果你喜欢或者对你有帮助，那就 Star 一下吧  \n如果你发现有任何问题，欢迎 PR 修正。\n\n持续施工中，大量内容还未搬迁过来。以后应该会直接产出基于 markdown 生成的网页内容，方便浏览。\n\n## 专题\n\n### Linked List\n\n以下列表是[Linked List 标签列表](https://leetcode.com/tag/linked-list/)根据难度排序的结果：\n\n- 1290\\. Convert Binary Number in a Linked List to Integer\n  - [代码 | code](./code/1290.js)\n  - [中文题解] TBD\n  - [leetcode post]()\n- [LOCKED] 1474\\. Delete N Nodes After M Nodes of a Linked List\n- 876\\. Middle of the Linked List\n  - [代码 | code](./code/876.js)\n  - [中文题解] TBD\n  - [leetcode post]()\n### String\n\n以下列表是[Linked List 标签列表](https://leetcode.com/tag/string/)根据难度排序的结果：\n\n- 1790\\. 仅执行一次字符串交换能否使两个字符串相等 (Check if One String Swap Can Make Strings Equal)\n  - [代码 | code](./code/1790.js)\n  - [中文题解](./posts/1790.md)\n  - [leetcode post](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/discuss/1111937/JavaScript-Easy-to-understand-2-solutions)\n\n### Sliding Window\n\n以下列表是[Sliding Window 标签列表](https://leetcode.com/tag/sliding-window/)根据难度排序的结果：\n\n- [LOCKED] 1176. Diet Plan Performance\n- [LOCKED] 1100. Find K-Length Substrings With No Repeated Characters\n- [LOCKED] 1151. Minimum Swaps to Group All 1's Together\n- [1004. Max Consecutive Ones III](./code/1004.js)\n- [1208. Get Equal Substrings Within Budget](./code/1208.js)\n- [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](./code/1438.js)\n\n## LEETCODE 周赛\n\n### Weekly Contest 175\n\n- [1346. 检查整数及其两倍数是否存在](./posts/1346.md)\n- [1347. 制造字母异位词的最小步骤数](./posts/1347.md)\n- [1348. 推文计数](./posts/1348.md)\n\n### Weekly Contest 174\n\n- [1337. 方阵中战斗力最弱的 K 行](./posts/1337.md)\n- [1338. 数组大小减半](./posts/1338.md)\n- [1339. 分裂二叉树的最大乘积](./posts/1339.md)\n- [1340. 跳跃游戏 V](./posts/1340.md)\n\n### Weekly Contest 173\n\n- [1332. 删除回文子序列](./posts/1332.md)\n- [1333. 餐厅过滤器](./posts/1333.md)\n- [1334. 阈值距离内邻居最少的城市](./posts/1334.md)\n- [1335. 工作计划的最低难度](./posts/1335.md)\n\n### Weekly Contest 172\n\n- [1323. 6 和 9 组成的最大数字](./posts/1323.md)\n- [1324. 竖直打印单词](./posts/1324.md)\n- [1325. 删除给定值的叶子节点](./posts/1325.md)\n- [1326. 灌溉花园的最少水龙头数目](./posts/1326.md)\n\n### Weekly Contest 171\n\n- [1317. 将整数转换为两个无零整数的和](./posts/1317.md)\n- [1318. 或运算的最小翻转次数](./posts/1318.md)\n- [1319. 连通网络的操作次数](./posts/1319.md)\n- [1320. 二指输入的的最小距离](./posts/1320.md)\n\n### Weekly Contest 170\n\n- [1309. 解码字母到整数映射](./posts/1309.md)\n- [1310. 子数组异或查询](./posts/1310.md)\n- [1311. 获取你好友已观看的视频](./posts/1311.md)\n- [1312. 让字符串成为回文串的最少插入次数](./posts/1312.md)\n\n### Weekly Contest 169\n\n- [1304. 和为零的N个唯一整数](./posts/1304.md)\n- [1305. 两棵二叉搜索树中的所有元素](./posts/1305.md)\n- [1306. 跳跃游戏 III](./posts/1306.md)\n- [1307. 口算难题](./posts/1307.md)\n\n### Weekly Contest 168\n\n- [1295. 统计位数为偶数的数字](./posts/1295.md)\n- [1296. 划分数组为连续数字的集合](./posts/1296.md)\n- [1297. 子串的最大出现次数](./posts/1297.md)\n- [1298. 你能从盒子里获得的最大糖果数](./posts/1298.md)\n\n## 活动\n\n### 30-Day LeetCoding Challenge\n\n活动地址在[这里](https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/)（如果被重定向回中文站了，去掉域名里的 `-cn` 即可）。\n\n- 4 月 1 号：[136. 只出现一次的数字](./30-Day%20LeetCoding%20Challenge/1.md)\n- 4 月 2 号：[202. 快乐数](./30-Day%20LeetCoding%20Challenge/2.md)\n- 4 月 3 号：[53. 最大子序和](./30-Day%20LeetCoding%20Challenge/3.md)\n- 4 月 4 号：[283. 移动零](./30-Day%20LeetCoding%20Challenge/4.md)\n- 4 月 5 号：[122. 买卖股票的最佳时机 II](./30-Day%20LeetCoding%20Challenge/5.md)\n- 4 月 6 号：[49. 字母异位词分组](./30-Day%20LeetCoding%20Challenge/6.md)\n- 4 月 7 号：[新题. Counting Elements](./30-Day%20LeetCoding%20Challenge/7.md)\n- 4 月 8 号：[876. 链表的中间结点](./30-Day%20LeetCoding%20Challenge/8.md)\n- 4 月 9 号：[844. 比较含退格的字符串](./30-Day%20LeetCoding%20Challenge/9.md)\n- 4 月 10 号：[155. 最小栈](./30-Day%20LeetCoding%20Challenge/10.md)\n- 4 月 11 号：[543. 二叉树的直径](./30-Day%20LeetCoding%20Challenge/11.md)\n- 4 月 12 号：[1046. 最后一块石头的重量](./30-Day%20LeetCoding%20Challenge/12.md)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpoppinlp%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpoppinlp%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpoppinlp%2Fleetcode/lists"}