coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]maximum-subarray-sum-after-one-operation.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.9K\", \"totalAcceptedRaw\": 1723, \"totalSubmissionRaw\": 2924, \"acRate\": \"58.9%\"}",
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1743, \"totalSubmissionRaw\": 2955, \"acRate\": \"59.0%\"}",
"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.",