coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/find-all-lonely-numbers-in-the-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 200,
"dislikes": 28,
"likes": 218,
"dislikes": 31,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Frequency of the Most Frequent Element\", \"titleSlug\": \"frequency-of-the-most-frequent-element\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[10,6,5,8]\n[1,3,5,3]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"36.5K\", \"totalAcceptedRaw\": 22083, \"totalSubmissionRaw\": 36538, \"acRate\": \"60.4%\"}",
"stats": "{\"totalAccepted\": \"23K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 23040, \"totalSubmissionRaw\": 38004, \"acRate\": \"60.6%\"}",
"hints": [
"For a given element x, how can you quickly check if x - 1 and x + 1 are present in the array without reiterating through the entire array?",
"Use a set or a hash map."