{"id":23273291,"url":"https://github.com/xwchris/leetcode","last_synced_at":"2025-04-06T10:24:51.573Z","repository":{"id":168938914,"uuid":"184049416","full_name":"xwchris/Leetcode","owner":"xwchris","description":"前端也要学习算法，记录Leetcode解题过程","archived":false,"fork":false,"pushed_at":"2019-05-05T11:06:52.000Z","size":35,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-12T15:53:24.375Z","etag":null,"topics":["algorithms","frontend","javascript","leetcode"],"latest_commit_sha":null,"homepage":"https://github.com/xwchris/Leetcode","language":"JavaScript","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/xwchris.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":"2019-04-29T10:22:17.000Z","updated_at":"2019-05-10T06:54:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"8717cb96-fa1e-416a-a107-9b8d6946c415","html_url":"https://github.com/xwchris/Leetcode","commit_stats":null,"previous_names":["xwchris/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xwchris%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xwchris%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xwchris%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xwchris%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/xwchris","download_url":"https://codeload.github.com/xwchris/Leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247465903,"owners_count":20943278,"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","frontend","javascript","leetcode"],"created_at":"2024-12-19T19:33:41.167Z","updated_at":"2025-04-06T10:24:51.540Z","avatar_url":"https://github.com/xwchris.png","language":"JavaScript","readme":"# Leetcode\n记录Leetcode解题过程。\n\n题目来自Leetcode中文版平台（力扣 ）[https://leetcode-cn.com/](https://leetcode-cn.com/)\n\n| 问题 | 难度 | 原题链接 | 标签 |\n| --- | --- | --- | --- |\n| [3. 无重复最长子串](https://github.com/xwchris/Leetcode/tree/master/3.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2) | Medium | [传送门](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/submissions/) | 字符串 |\n| [15. 三数之和](https://github.com/xwchris/Leetcode/tree/master/15.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C) | Medium | [传送门](https://leetcode-cn.com/problems/3sum/) | 数组、排序 |\n| [33. 搜索旋转排序数组](https://github.com/xwchris/Leetcode/tree/master/33.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84) | Medium | [传送门](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/submissions/) | 数组，查找 |\n| [42. 接雨水](https://github.com/xwchris/Leetcode/blob/master/42.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4) | Hard | [传送门](https://leetcode-cn.com/problems/trapping-rain-water/) | 数组 |\n| [94. 二叉树的中序遍历](https://github.com/xwchris/Leetcode/tree/master/94.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86) | Medium | [传送门](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/) | 二叉树 |\n| [102. 二叉树的层次遍历](https://github.com/xwchris/Leetcode/tree/master/102.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E6%AC%A1%E9%81%8D%E5%8E%86) | Medium | [传送门](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/) | 二叉树 |\n| [144. 二叉树的前序遍历](https://github.com/xwchris/Leetcode/tree/master/144.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%89%8D%E5%BA%8F%E9%81%8D%E5%8E%86) | Medium | [传送门](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/) | 二叉树 |\n| [393. UTF-8编码验证](https://github.com/xwchris/Leetcode/tree/master/393.%20UTF-8%E7%BC%96%E7%A0%81%E9%AA%8C%E8%AF%81) | Medium | [传送门](https://leetcode-cn.com/problems/utf-8-validation/) | 二进制 |\n| [695. 岛屿的最大面积](https://github.com/xwchris/Leetcode/tree/master/695.%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF) | Medium | [传送门](https://leetcode-cn.com/problems/max-area-of-island/) | 数组、图 |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxwchris%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fxwchris%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxwchris%2Fleetcode/lists"}