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-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-size-subarray-sum-equals-k.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"22K\", \"totalAcceptedRaw\": 11741, \"totalSubmissionRaw\": 21965, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"22K\", \"totalAcceptedRaw\": 11763, \"totalSubmissionRaw\": 21998, \"acRate\": \"53.5%\"}",
"hints": [
"Compute the prefix sum array where psum[i] is the sum of all the elements from <i>0</i> to <i>i</i>.",
"At each index <i>i</i>, the sum of the prefix is psum[i], so we are searching for the index x where psum[x] = psum[i] - k.\r\nThe subarray [x + 1, i] will be of sum k.",