coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/minimum-distance-to-the-target-element.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 166,
"dislikes": 38,
"likes": 172,
"dislikes": 39,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4,5]\n5\n3\n[1]\n1\n0\n[1,1,1,1,1,1,1,1,1,1]\n1\n0",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 24159, \"totalSubmissionRaw\": 40388, \"acRate\": \"59.8%\"}",
"stats": "{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 24723, \"totalSubmissionRaw\": 41423, \"acRate\": \"59.7%\"}",
"hints": [
"Loop in both directions until you find the target element.",
"For each index i such that nums[i] == target calculate abs(i - start)."