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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-number-of-changes-to-make-binary-string-beautiful.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 94,
"dislikes": 3,
"likes": 117,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"1001\"\n\"10\"\n\"0000\"",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"24.9K\", \"totalAcceptedRaw\": 14221, \"totalSubmissionRaw\": 24854, \"acRate\": \"57.2%\"}",
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"27.4K\", \"totalAcceptedRaw\": 15962, \"totalSubmissionRaw\": 27383, \"acRate\": \"58.3%\"}",
"hints": [
"For any valid partition, since each part consists of an even number of the same characters, we can further partition each part into lengths of exactly <code>2</code>.",
"After noticing the first hint, we can decompose the whole string into disjoint blocks of size <code>2</code> and find the minimum number of changes required to make those blocks beautiful."