coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/[no content]maximum-size-subarray-sum-equals-k.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"178.8K\", \"totalSubmission\": \"362.1K\", \"totalAcceptedRaw\": 178759, \"totalSubmissionRaw\": 362057, \"acRate\": \"49.4%\"}",
"stats": "{\"totalAccepted\": \"178.8K\", \"totalSubmission\": \"362.1K\", \"totalAcceptedRaw\": 178768, \"totalSubmissionRaw\": 362072, \"acRate\": \"49.4%\"}",
"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.",