{"id":18008134,"url":"https://github.com/laizimo/leetcode-answer","last_synced_at":"2025-03-26T12:32:02.691Z","repository":{"id":195670983,"uuid":"104202315","full_name":"laizimo/leetcode-answer","owner":"laizimo","description":":question:此项目记录leetcode的算法题题解，使用javascript语言。","archived":false,"fork":false,"pushed_at":"2020-06-06T03:09:39.000Z","size":189,"stargazers_count":224,"open_issues_count":22,"forks_count":13,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-21T19:12:14.677Z","etag":null,"topics":["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/laizimo.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}},"created_at":"2017-09-20T10:41:40.000Z","updated_at":"2024-09-30T12:25:36.000Z","dependencies_parsed_at":"2023-09-19T06:15:13.353Z","dependency_job_id":null,"html_url":"https://github.com/laizimo/leetcode-answer","commit_stats":null,"previous_names":["laizimo/leetcode-answer"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/laizimo%2Fleetcode-answer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/laizimo%2Fleetcode-answer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/laizimo%2Fleetcode-answer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/laizimo%2Fleetcode-answer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/laizimo","download_url":"https://codeload.github.com/laizimo/leetcode-answer/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245654298,"owners_count":20650840,"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":["javascript","leetcode","solutions"],"created_at":"2024-10-30T01:17:35.278Z","updated_at":"2025-03-26T12:32:02.386Z","avatar_url":"https://github.com/laizimo.png","language":null,"readme":"# leetcode-answer\n此项目记录leetcode的算法题题解，使用javascript语言。\n\n# 题目汇总\n\n### 数字\n\n[整数反转 - 第七题](https://github.com/laizimo/leetcode-answer/issues/8)\n\n[字符串转换整数 (atoi) - 第八题](https://github.com/laizimo/leetcode-answer/issues/9)\n\n[整数转罗马数字 - 第十二题](https://github.com/laizimo/leetcode-answer/issues/13)\n\n[罗马数字转整数 - 第十三题](https://github.com/laizimo/leetcode-answer/issues/14)\n\n### 字符串\n\n[无重复字符的最长子串 - 第三题](https://github.com/laizimo/leetcode-answer/issues/4)\n\n[Z 字形变换 - 第六题](https://github.com/laizimo/leetcode-answer/issues/7)\n\n[最长公共前缀 - 第十四题](https://github.com/laizimo/leetcode-answer/issues/15)\n\n[电话号码的字母组合 - 第十七题](https://github.com/laizimo/leetcode-answer/issues/18)\n\n### 数组\n\n[两数之和 - 第一题](https://github.com/laizimo/leetcode-answer/issues/2)\n\n[盛最多水的容器 - 第十一题](https://github.com/laizimo/leetcode-answer/issues/12)\n\n[三数之和 - 第十五题](https://github.com/laizimo/leetcode-answer/issues/16)\n\n[最接近三数之和 - 第十六题](https://github.com/laizimo/leetcode-answer/issues/17)\n\n[四数之和 - 第十八题](https://github.com/laizimo/leetcode-answer/issues/19)\n\n### 链表\n\n[两数相加 - 第二题](https://github.com/laizimo/leetcode-answer/issues/3)\n\n[删除链表的倒数第N个节点 - 第十九题](https://github.com/laizimo/leetcode-answer/issues/20)\n\n[合并两个有序链表 - 第二十一题](https://github.com/laizimo/leetcode-answer/issues/22)\n\n### 栈\n\n[有效的括号 - 第二十题](https://github.com/laizimo/leetcode-answer/issues/21)\n\n### 树\n\n### 递归\n\n[回文数 - 第九题](https://github.com/laizimo/leetcode-answer/issues/10)\n\n[正则表达式匹配 - 第十题](https://github.com/laizimo/leetcode-answer/issues/11)\n\n### 动态规划\n\n[最长回文子串 - 第五题](https://github.com/laizimo/leetcode-answer/issues/6)\n\n### 二分法\n\n[寻找两个正序数组的中位数 - 第四题](https://github.com/laizimo/leetcode-answer/issues/5)\n\n### 贪婪算法\n\n### 分治算法\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flaizimo%2Fleetcode-answer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flaizimo%2Fleetcode-answer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flaizimo%2Fleetcode-answer/lists"}