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/maximum-subarray-min-product.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 731,
"dislikes": 42,
"likes": 754,
"dislikes": 43,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,2]\n[2,3,3,1,2]\n[3,1,5,6,4,2]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 11512, \"totalSubmissionRaw\": 32608, \"acRate\": \"35.3%\"}",
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"33.8K\", \"totalAcceptedRaw\": 11934, \"totalSubmissionRaw\": 33766, \"acRate\": \"35.3%\"}",
"hints": [
"Is there a way we can sort the elements to simplify the problem?",
"Can we find the maximum min-product for every value in the array?"