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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"43.2K\", \"totalAcceptedRaw\": 19367, \"totalSubmissionRaw\": 43162, \"acRate\": \"44.9%\"}",
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"43.2K\", \"totalAcceptedRaw\": 19371, \"totalSubmissionRaw\": 43170, \"acRate\": \"44.9%\"}",
"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."
],