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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-swaps-to-group-all-1s-together-ii.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 5345, \"totalSubmissionRaw\": 11418, \"acRate\": \"46.8%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 5361, \"totalSubmissionRaw\": 11444, \"acRate\": \"46.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.",