{"id":17968093,"url":"https://github.com/mlemoe/leetcode","last_synced_at":"2025-04-03T21:40:27.593Z","repository":{"id":138973470,"uuid":"353356468","full_name":"MleMoe/LeetCode","owner":"MleMoe","description":"LeetCode 脚手架，妈妈再也不用担心孩子不爱写题了🥺","archived":false,"fork":false,"pushed_at":"2022-04-08T00:06:27.000Z","size":562,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-09T09:30:04.306Z","etag":null,"topics":["leetcode","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/MleMoe.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,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-03-31T12:54:54.000Z","updated_at":"2022-04-03T13:14:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"697ebc82-76ec-441e-a733-67dd81a1f13c","html_url":"https://github.com/MleMoe/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/MleMoe%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MleMoe%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MleMoe%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MleMoe%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MleMoe","download_url":"https://codeload.github.com/MleMoe/LeetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247085980,"owners_count":20881157,"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","typescript"],"created_at":"2024-10-29T14:10:51.365Z","updated_at":"2025-04-03T21:40:27.565Z","avatar_url":"https://github.com/MleMoe.png","language":"TypeScript","readme":"# LeetCode\n\n[![LeetCode TOC](https://github.com/MleMoe/LeetCode/workflows/LeetCode%20TOC/badge.svg)](https://github.com/MleMoe/LeetCode/actions?query=workflow%3A%22LeetCode+TOC%22)\n\n[LeetCode](https://leetcode-cn.com) Practice [TOC 目录](https://mlemoe.github.io/LeetCode/)\n\n## Language\n\n\u003c!-- \u003ccode\u003e\u003cimg height=\"20\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/javascript/javascript.png\"\u003e\u003c/code\u003e --\u003e\n\n\u003ccode\u003e\u003cimg height=\"20\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/typescript/typescript.png\"\u003e\u003c/code\u003e\n\u003ccode\u003e\u003cimg height=\"20\" src=\"https://raw.githubusercontent.com/github/explore/80688e429a7d4ef2fca1e82350fe8e3517d3494d/topics/python/python.png\"\u003e\u003c/code\u003e\n\n- TypeScript\n- Python3\n\n## Usage\n\n### Generate TOC\n\n```sh\nyarn generate:TOC\n```\n\n### Lint\n\n[ESLint](https://eslint.org/)\n\n- husky\n- lint-staged\n\n```sh\nyarn lint\n```\n\n## Cli\n\n### Link Cli\n\n### 开始解题\n\n```sh\nyarn start\n```\n\n跟随提示，输入题目 ID，标题，索引，难易度，将会自动建立对应文件夹并记录信息至 `package.json`。\n\n结果检验注意事项，为满足多参数输入，传参用 `[ ]` 包裹。\n\n```js\n// function findNumberIn2DArray(matrix: number[][], target: number): boolean {}\nconst testcases = [\n  [\n    [\n      [1, 4, 7, 11, 15],\n      [2, 5, 8, 12, 19],\n      [3, 6, 9, 16, 22],\n      [10, 13, 14, 17, 24],\n      [18, 21, 23, 26, 30],\n    ],\n    5,\n  ],\n  [\n    [\n      [1, 4, 7, 11, 15],\n      [2, 5, 8, 12, 19],\n      [3, 6, 9, 16, 22],\n      [10, 13, 14, 17, 24],\n      [18, 21, 23, 26, 30],\n    ],\n    20,\n  ],\n]\nconst expectedReults = [true, false]\n```\n\n### 解题完毕\n\n```sh\nyarn solve\n```\n\n输入对应题目 ID，将会通过自动提交带有题目信息的 `commit`。\n\n如：`git commit -m \"✅ solve palindrome-number\"`\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmlemoe%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmlemoe%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmlemoe%2Fleetcode/lists"}