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

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 156,
"likes": 158,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Size Subarray Sum\", \"titleSlug\": \"minimum-size-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u957f\\u5ea6\\u6700\\u5c0f\\u7684\\u5b50\\u6570\\u7ec4\"}, {\"title\": \"Range Sum Query - Immutable\", \"titleSlug\": \"range-sum-query-immutable\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u533a\\u57df\\u548c\\u68c0\\u7d22 - \\u6570\\u7ec4\\u4e0d\\u53ef\\u53d8\"}, {\"title\": \"Contiguous Array\", \"titleSlug\": \"contiguous-array\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8fde\\u7eed\\u6570\\u7ec4\"}, {\"title\": \"Subarray Product Less Than K\", \"titleSlug\": \"subarray-product-less-than-k\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4e58\\u79ef\\u5c0f\\u4e8eK\\u7684\\u5b50\\u6570\\u7ec4\"}]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"22K\", \"totalAcceptedRaw\": 11763, \"totalSubmissionRaw\": 21998, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 12183, \"totalSubmissionRaw\": 22810, \"acRate\": \"53.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.",