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

6
leetcode/originData/[no content]minimum-swaps-to-group-all-1s-together.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 752,
"dislikes": 10,
"likes": 753,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Adjacent Swaps for K Consecutive Ones\", \"titleSlug\": \"minimum-adjacent-swaps-for-k-consecutive-ones\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Swaps to Group All 1's Together II\", \"titleSlug\": \"minimum-swaps-to-group-all-1s-together-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,0,1,0,1]\n[0,0,0,1,0]\n[1,0,1,0,1,0,0,1,1,0,1]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"34.4K\", \"totalSubmission\": \"57.9K\", \"totalAcceptedRaw\": 34397, \"totalSubmissionRaw\": 57917, \"acRate\": \"59.4%\"}",
"stats": "{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"58.3K\", \"totalAcceptedRaw\": 34641, \"totalSubmissionRaw\": 58308, \"acRate\": \"59.4%\"}",
"hints": [
"How many 1's should be grouped together ? Is not a fixed number?",
"Yeah it's just the number of 1's the whole array has. Let's name this number as ones",