coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/minimum-size-subarray-in-infinite-array.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"53.1K\", \"totalAcceptedRaw\": 16001, \"totalSubmissionRaw\": 53054, \"acRate\": \"30.2%\"}",
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"53.1K\", \"totalAcceptedRaw\": 16005, \"totalSubmissionRaw\": 53063, \"acRate\": \"30.2%\"}",
"hints": [
"Notice that, <code>target</code> is either: A subarray of <code>nums</code>, or <code>prefix_sum[i]</code> + <code> k * sum(nums) </code> + <code>suffix_sum[j]</code> for some <code>i, j, k</code>.",
"You can solve the problem for those two separate cases using hash map and prefix sums."