coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/moving-stones-until-consecutive.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 145,
"dislikes": 582,
"likes": 149,
"dislikes": 584,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n2\n5\n4\n3\n2\n3\n5\n1",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"43.2K\", \"totalAcceptedRaw\": 19371, \"totalSubmissionRaw\": 43170, \"acRate\": \"44.9%\"}",
"stats": "{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 19538, \"totalSubmissionRaw\": 43443, \"acRate\": \"45.0%\"}",
"hints": [
"For the minimum: We can always do it in at most 2 moves, by moving one stone next to another, then the third stone next to the other two. When can we do it in 1 move? 0 moves?\r\n\r\nFor the maximum: Every move, the maximum position minus the minimum position must decrease by at least 1."
],