coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 17:01:42 +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/originData/minimum-swaps-to-group-all-1s-together-ii.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"48K\", \"totalAcceptedRaw\": 24895, \"totalSubmissionRaw\": 48045, \"acRate\": \"51.8%\"}",
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"48.1K\", \"totalAcceptedRaw\": 24904, \"totalSubmissionRaw\": 48062, \"acRate\": \"51.8%\"}",
"hints": [
"Notice that the number of 1’s to be grouped together is fixed. It is the number of 1's the whole array has.",
"Call this number total. We should then check for every subarray of size total (possibly wrapped around), how many swaps are required to have the subarray be all 1’s.",