coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/ways-to-split-array-into-good-subarrays.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4017, \"totalSubmissionRaw\": 10226, \"acRate\": \"39.3%\"}",
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4020, \"totalSubmissionRaw\": 10230, \"acRate\": \"39.3%\"}",
"hints": [
"If the array consists of only 0s answer is 0.",
"In the final split, exactly one separation point exists between two consecutive 1s.",