coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 25562, \"totalSubmissionRaw\": 51461, \"acRate\": \"49.7%\"}",
"stats": "{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 25565, \"totalSubmissionRaw\": 51468, \"acRate\": \"49.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."
],