coder-xiaomo/leetcode-problemset
1
0
Fork 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

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-length-of-subarray-with-positive-product.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1249,
"dislikes": 19,
"likes": 1329,
"dislikes": 23,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,-2,-3,4]\n[0,1,-2,-3,-4]\n[-1,-2,-3,0,1]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"42K\", \"totalSubmission\": \"98.3K\", \"totalAcceptedRaw\": 42022, \"totalSubmissionRaw\": 98254, \"acRate\": \"42.8%\"}",
"stats": "{\"totalAccepted\": \"45.6K\", \"totalSubmission\": \"106.3K\", \"totalAcceptedRaw\": 45615, \"totalSubmissionRaw\": 106310, \"acRate\": \"42.9%\"}",
"hints": [
"Split the whole array into subarrays by zeroes since a subarray with positive product cannot contain any zero.",
"If the subarray has even number of negative numbers, the whole subarray has positive product.",