coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/smallest-index-with-equal-value.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 138,
"dislikes": 65,
"likes": 148,
"dislikes": 67,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[0,1,2]\n[4,3,2,1]\n[1,2,3,4,5,6,7,8,9,0]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.6K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 22557, \"totalSubmissionRaw\": 30764, \"acRate\": \"73.3%\"}",
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"32.7K\", \"totalAcceptedRaw\": 23869, \"totalSubmissionRaw\": 32656, \"acRate\": \"73.1%\"}",
"hints": [
"Starting with i=0, check the condition for each index. The first one you find to be true is the smallest index."
],