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

4
leetcode/originData/maximum-sum-of-two-non-overlapping-subarrays.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1627,
"likes": 1676,
"dislikes": 70,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"48.4K\", \"totalSubmission\": \"81.5K\", \"totalAcceptedRaw\": 48407, \"totalSubmissionRaw\": 81501, \"acRate\": \"59.4%\"}",
"stats": "{\"totalAccepted\": \"49.3K\", \"totalSubmission\": \"83.1K\", \"totalAcceptedRaw\": 49285, \"totalSubmissionRaw\": 83129, \"acRate\": \"59.3%\"}",
"hints": [
"We can use prefix sums to calculate any subarray sum quickly.\r\nFor each L length subarray, find the best possible M length subarray that occurs before and after it."
],