1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 9,
"likes": 12,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -64,7 +64,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"291\", \"totalSubmission\": \"538\", \"totalAcceptedRaw\": 291, \"totalSubmissionRaw\": 538, \"acRate\": \"54.1%\"}",
"stats": "{\"totalAccepted\": \"360\", \"totalSubmission\": \"647\", \"totalAcceptedRaw\": 360, \"totalSubmissionRaw\": 647, \"acRate\": \"55.6%\"}",
"hints": [
"Change the zeros in nums to -1 and create a prefix sum array prefixSum using the new nums.",
"If prefixSum[i] for any index i in the range 0 <= i < prefixSum.length is positive, that means that there are more ones than zeros in the prefix ending at index i.",