coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-23 05:48:57 +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

2
leetcode-cn/originData/moving-stones-until-consecutive.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 11863, \"totalSubmissionRaw\": 29894, \"acRate\": \"39.7%\"}",
"stats": "{\"totalAccepted\": \"12K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 11996, \"totalSubmissionRaw\": 30190, \"acRate\": \"39.7%\"}",
"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."
],