coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/find-all-k-distant-indices-in-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 149,
"dislikes": 22,
"likes": 153,
"dislikes": 23,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Two Sum\", \"titleSlug\": \"two-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Shortest Word Distance\", \"titleSlug\": \"shortest-word-distance\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,4,9,1,3,9,5]\n9\n1\n[2,2,2,2,2]\n2\n2",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 19338, \"totalSubmissionRaw\": 29943, \"acRate\": \"64.6%\"}",
"stats": "{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 19536, \"totalSubmissionRaw\": 30223, \"acRate\": \"64.6%\"}",
"hints": [
"For every occurrence of key in nums, find all indices within distance k from it.",
"Use a hash table to remove duplicate indices."