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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-score-after-splitting-a-string.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 483,
"dislikes": 24,
"likes": 491,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"011101\"\n\"00111\"\n\"1111\"",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.9K\", \"totalSubmission\": \"65.6K\", \"totalAcceptedRaw\": 37875, \"totalSubmissionRaw\": 65585, \"acRate\": \"57.7%\"}",
"stats": "{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"66.4K\", \"totalAcceptedRaw\": 38384, \"totalSubmissionRaw\": 66433, \"acRate\": \"57.8%\"}",
"hints": [
"Precompute a prefix sum of ones ('1').",
"Iterate from left to right counting the number of zeros ('0'), then use the precomputed prefix sum for counting ones ('1'). Update the answer."