coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +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-ii.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2979, \"totalSubmissionRaw\": 5707, \"acRate\": \"52.2%\"}",
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 3015, \"totalSubmissionRaw\": 5773, \"acRate\": \"52.2%\"}",
"hints": [
"For the minimum, how many cows are already in place?\r\nFor the maximum, we have to lose either the gap A[1] - A[0] or A[N-1] - A[N-2] (where N = A.length), but every other space can be occupied."
],