mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 753,
|
||||
"likes": 787,
|
||||
"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}]",
|
||||
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"58.3K\", \"totalAcceptedRaw\": 34641, \"totalSubmissionRaw\": 58308, \"acRate\": \"59.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"37.3K\", \"totalSubmission\": \"62.9K\", \"totalAcceptedRaw\": 37308, \"totalSubmissionRaw\": 62893, \"acRate\": \"59.3%\"}",
|
||||
"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",
|
||||
|
Reference in New Issue
Block a user