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-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-latest-group-of-size-m.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 434,
"dislikes": 92,
"likes": 450,
"dislikes": 94,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,5,1,2,4]\n1\n[3,1,5,4,2]\n2",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"30K\", \"totalAcceptedRaw\": 12194, \"totalSubmissionRaw\": 29954, \"acRate\": \"40.7%\"}",
"stats": "{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 12405, \"totalSubmissionRaw\": 30469, \"acRate\": \"40.7%\"}",
"hints": [
"Since the problem asks for the latest step, can you start the searching from the end of arr?",
"Use a map to store the current “1” groups.",