{"id":15521913,"url":"https://github.com/crossoverjie/leetcode","last_synced_at":"2025-04-23T03:48:24.418Z","repository":{"id":94777486,"uuid":"112387208","full_name":"crossoverJie/leetcode","owner":"crossoverJie","description":"🕵️‍♂️ leetcode practice","archived":false,"fork":false,"pushed_at":"2021-04-29T03:26:05.000Z","size":56,"stargazers_count":51,"open_issues_count":0,"forks_count":34,"subscribers_count":6,"default_branch":"master","last_synced_at":"2025-04-23T03:48:17.960Z","etag":null,"topics":["algorithms","java","leetcode"],"latest_commit_sha":null,"homepage":"","language":"Java","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/crossoverJie.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":"2017-11-28T20:45:33.000Z","updated_at":"2023-05-11T16:18:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"b309540e-3314-4036-aa79-a72b8779dd94","html_url":"https://github.com/crossoverJie/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/crossoverJie%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crossoverJie%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crossoverJie%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/crossoverJie%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/crossoverJie","download_url":"https://codeload.github.com/crossoverJie/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250366681,"owners_count":21418768,"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","java","leetcode"],"created_at":"2024-10-02T10:38:32.300Z","updated_at":"2025-04-23T03:48:24.398Z","avatar_url":"https://github.com/crossoverJie.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\n\n[![Build Status](https://travis-ci.org/crossoverJie/leetcode.svg?branch=master)](https://travis-ci.org/crossoverJie/leetcode)\n[![codecov](https://codecov.io/gh/crossoverJie/leetcode/branch/master/graph/badge.svg)](https://codecov.io/gh/crossoverJie/leetcode)\n[![Coverage Status](https://coveralls.io/repos/github/crossoverJie/leetcode/badge.svg)](https://coveralls.io/github/crossoverJie/leetcode)\n\n众所周知 `LeetCode` 是一个刷算法题的网站，参加 `ACM` 或者是大厂面试都有重要作用。\n\n所以以下内容我是空余时间的题解，有着详细的注释。\n\n刷题的顺序由易到难，有任何疑问欢迎提出，共勉！\n\n\n\n## Easy\n\nNO | Title | Solution\n---- | --- | ---\n1| [Two Sum](https://leetcode.com/problems/two-sum)   | [TwoSum.java](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/TwoSum.java)\n7 |  [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [ReverseInteger](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/ReverseInteger.java)\n9 |  [Palindrome Number](https://leetcode.com/problems/palindrome-number/description/) | [PalindromeNumber](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/PalindromeNumber.java)\n20 |  [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/description/) | [ValidParentheses](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/ValidParentheses.java)\n21 |  [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/description/) | [MergeTwoSortedLists](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/MergeTwoSortedLists.java)\n22 |  [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) | [RemoveDuplicatesSortedArray](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/RemoveDuplicatesSortedArray.java)\n35 |  [Search Insert Position](https://leetcode.com/problems/search-insert-position/description/) | [SearchInsertPosition](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/SearchInsertPosition.java)\n83 |  [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/) | [RemoveDuplicatesFromSortedList](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/easy/RemoveDuplicatesFromSortedList.java)\n\n\n## Medium\n\nNO | Title | Solution\n---- | --- | ---\n19| [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/)   | [RemoveNthNodeFromEndOfList.java](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/medium/RemoveNthNodeFromEndOfList.java)\n151| [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/description/)   | [ReverseWordsInAString.java](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/medium/ReverseWordsInAString.java)\n347| [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/description/)   | [TopKFrequentElements.java](https://github.com/crossoverJie/leetcode/blob/master/src/main/java/com/crossoverjie/leetcode/medium/TopKFrequentElements.java)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcrossoverjie%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcrossoverjie%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcrossoverjie%2Fleetcode/lists"}