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:
小墨
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

2
leetcode-cn/originData/[no content]sum-of-special-evenly-spaced-elements-in-array.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"306\", \"totalSubmission\": \"527\", \"totalAcceptedRaw\": 306, \"totalSubmissionRaw\": 527, \"acRate\": \"58.1%\"}",
"stats": "{\"totalAccepted\": \"311\", \"totalSubmission\": \"535\", \"totalAcceptedRaw\": 311, \"totalSubmissionRaw\": 535, \"acRate\": \"58.1%\"}",
"hints": [
"Think if y cannot be small. You can solve a query in O(n/y), so if y is large enough, it won't be a problem.",
"If y is small, like less than B, you can preprocess the answers for all such ys in O(n * B), then answer each such query in O(1).",