coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +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-cn/originData/[no content]maximum-subarray-sum-after-one-operation.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 16,
"likes": 19,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1743, \"totalSubmissionRaw\": 2955, \"acRate\": \"59.0%\"}",
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 1896, \"totalSubmissionRaw\": 3200, \"acRate\": \"59.2%\"}",
"hints": [
"Think about dynamic programming",
"Define an array dp[nums.length][2], where dp[i][0] is the max subarray sum including nums[i] and without squaring any element.",