coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51: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

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

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 283,
"dislikes": 495,
"dislikes": 496,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Number of Operations to Make Array Continuous\", \"titleSlug\": \"minimum-number-of-operations-to-make-array-continuous\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[7,4,9]\n[6,5,4,3,10]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"13.7K\", \"totalAcceptedRaw\": 7574, \"totalSubmissionRaw\": 13668, \"acRate\": \"55.4%\"}",
"stats": "{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"13.7K\", \"totalAcceptedRaw\": 7581, \"totalSubmissionRaw\": 13675, \"acRate\": \"55.4%\"}",
"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."
],