{"id":17010463,"url":"https://github.com/cool-coding/leetcode","last_synced_at":"2025-10-05T07:38:27.840Z","repository":{"id":101515885,"uuid":"132325503","full_name":"Cool-Coding/leetcode","owner":"Cool-Coding","description":"LeetCode exercise","archived":false,"fork":false,"pushed_at":"2018-06-02T13:28:43.000Z","size":9,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-06-08T00:05:03.637Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Java","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/Cool-Coding.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":"2018-05-06T09:45:57.000Z","updated_at":"2018-06-02T13:28:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"e155a9ac-a945-462c-8b15-d997e1fc8210","html_url":"https://github.com/Cool-Coding/leetcode","commit_stats":{"total_commits":8,"total_committers":1,"mean_commits":8.0,"dds":0.0,"last_synced_commit":"21ae085eb170dfae73fb195430b7a3b0bae46842"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Cool-Coding/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Cool-Coding%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Cool-Coding%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Cool-Coding%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Cool-Coding%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Cool-Coding","download_url":"https://codeload.github.com/Cool-Coding/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Cool-Coding%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":278425444,"owners_count":25984682,"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","status":"online","status_checked_at":"2025-10-05T02:00:06.059Z","response_time":54,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2024-10-14T06:04:35.651Z","updated_at":"2025-10-05T07:38:27.825Z","avatar_url":"https://github.com/Cool-Coding.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"### 001.AddTwoNumbers\n给定两个非空链表来表示两个非负整数。位数按照逆序方式存储，它们的每个节点只存储单个数字。将两数相加返回一个新的链表。\n你可以假设除了数字 0 之外，这两个数字都不会以零开头。\n示例：\n\u003e 输入：(2 -\u003e 4 -\u003e 3) + (5 -\u003e 6 -\u003e 4)\n\n\u003e 输出：7 -\u003e 0 -\u003e 8\n\n\u003e原因：342 + 465 = 807\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcool-coding%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcool-coding%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcool-coding%2Fleetcode/lists"}