coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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/[no content]count-subarrays-with-more-ones-than-zeros.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 74,
"dislikes": 4,
"likes": 84,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Ones and Zeroes\", \"titleSlug\": \"ones-and-zeroes\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longer Contiguous Segments of Ones than Zeros\", \"titleSlug\": \"longer-contiguous-segments-of-ones-than-zeros\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"All Divisions With the Highest Score of a Binary Array\", \"titleSlug\": \"all-divisions-with-the-highest-score-of-a-binary-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[0,1,1,0,1]\n[0]\n[1]",
@@ -64,7 +64,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1401, \"totalSubmissionRaw\": 2636, \"acRate\": \"53.1%\"}",
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.9K\", \"totalAcceptedRaw\": 1531, \"totalSubmissionRaw\": 2851, \"acRate\": \"53.7%\"}",
"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.",