{"id":19494669,"url":"https://github.com/zhanzengyu/awesome-leetcode","last_synced_at":"2026-02-13T22:54:21.385Z","repository":{"id":152237413,"uuid":"279213960","full_name":"zhanzengyu/awesome-leetcode","owner":"zhanzengyu","description":"leetcode 攻略之路","archived":false,"fork":false,"pushed_at":"2024-01-15T10:43:28.000Z","size":1017,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2024-05-22T03:04:58.654Z","etag":null,"topics":["leetcode","leetcode-java","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://github.com/nesger/awesome-leetcode","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/zhanzengyu.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,"roadmap":null,"authors":null}},"created_at":"2020-07-13T04:54:58.000Z","updated_at":"2023-07-29T02:45:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"4079924f-049f-46da-ac0e-417050bbc32e","html_url":"https://github.com/zhanzengyu/awesome-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/zhanzengyu%2Fawesome-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zhanzengyu%2Fawesome-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zhanzengyu%2Fawesome-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zhanzengyu%2Fawesome-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/zhanzengyu","download_url":"https://codeload.github.com/zhanzengyu/awesome-leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240740162,"owners_count":19849890,"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":["leetcode","leetcode-java","leetcode-solutions"],"created_at":"2024-11-10T21:31:25.003Z","updated_at":"2026-02-13T22:54:16.337Z","avatar_url":"https://github.com/zhanzengyu.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# awesome-leetcode\nleetcode 攻略之路\n\n### 思路\n递归（多见于链表）\n\n\n\u003chr/\u003e\n\n**下面都是使用 Python 语言实现的**\n\n### 滑动窗口\n\n| 序号   | 标题                                | 需要继续优化   |\n|:-----|:----------------------------------|:---------|\n| 2269 | [找到一个数字的 K 美丽值](./python/2269.md) | |\n\n\u003chr/\u003e\n\n**下面都是使用 Java 语言实现的**\n\n| 序号   | 标题                                    | 需要继续优化   |\n|:-----|:--------------------------------------|:---------|\n| 002  | [两数相加](./java/002.md)                 |\n| 021  | [合并两个有序链表](./java/021.md)             |\n| 026  | [删除有序数组中的重复项](./java/026.md)          | 需要       |\n| 103  | [二叉树的锯齿形层序遍历](./java/103.md)          |\n| 108  | [将有序数组转换为二叉搜索树](./java/108.md)        |\n| 110  | [平衡二叉树](./java/110.md)                |\n| 111  | [二叉树的最小深度](./java/111.md)             |\n| 112  | [路径总和](./java/112.md)                 |\n| 136  | [只出现一次的数字](./java/136.md)             |\n| 151  | [反转字符串中的单词](./java/151.md)            | 可以优化     |\n| 199  | [二叉树的右视图](./java/199.md)              |\n| 206  | [反转链表](./java/206.md)                 |\n| 238  | [除自身以外数组的乘积](./java/238.md)           | 重点关注     |\n| 283  | [移动零](./java/283.md)                  |\n| 328  | [奇偶链表](./java/328.md)                 |\n| 334  | [递增的三元子序列](./java/334.md)             | 重点关注     |\n| 345  | [反转字符串中的元音字母](./java/345.md)          |\n| 374  | [猜数字大小](./java/374.md)                |\n| 392  | [判断子序列](./java/392.md)                |\n| 394  | [字符串解码](./java/394.md)                |\n| 443  | [压缩字符串](./443.md)                     |\n| 643  | [子数组最大平均数 I](./java/643.md)           | 需要       |\n| 700  | [二叉搜索树中的搜索](./java/700.md)            |\n| 724  | [寻找数组的中心下标](./java/724.md)            | 可以优化     |\n| 735  | [小行星碰撞](./java/735.md)                | 可以优化     |\n| 872  | [叶子相似的树](./java/872.md)               | 尝试用dfs实现 |\n| 933  | [最近的请求次数](./java/933.md)              |\n| 1004 | [最大连续1的个数 III](./java/1004.md)        | 可以优化     |\n| 1137 | [第 N 个泰波那契数](./java/1137.md)          |\n| 1207 | [独一无二的出现次数](./java/1207.md)           |\n| 1431 | [拥有最多糖果的孩子](./java/1431.md)           |\n| 1456 | [定长子串中元音的最大数目](./java/1456.md)        |\n| 1493 | [删掉一个元素以后全为 1 的最长子数组](./java/1493.md) |\n| 1657 | [确定两个字符串是否接近](./java/1657.md)         |\n| 1679 | [K 和数对的最大数目](./java/1679.md)          | 可以优化     |\n| 1732 | [找到最高海拔](./java/1732.md)              |\n| 1768 | [交替合并字符串](./java/1768.md)             |\n| 2095 | [删除链表的中间节点](./java/2095.md)           | 可以优化     |\n| 2130 | [链表最大孪生和](./java/2130.md)             | 可以优化     |\n| 2215 | [找出两数组的不同](./java/2215.md)            |\n| 2390 | [从字符串中移除星号](./java/2390.md)           |\n| 2697 | [字典序最小回文串](./java/2697.md)            |\n\n\n\n\n\u003chr/\u003e\n\n你好，我是安卓小煜\n\n欢迎关注公众号 AndroidTraveler，一起学习，共同进步\n\n\u003cimg src=\"./res/image/wechat_official_account.jpg\" width=\"400\"/\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzhanzengyu%2Fawesome-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzhanzengyu%2Fawesome-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzhanzengyu%2Fawesome-leetcode/lists"}