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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"950\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 950, \"totalSubmissionRaw\": 1828, \"acRate\": \"52.0%\"}",
"stats": "{\"totalAccepted\": \"951\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 951, \"totalSubmissionRaw\": 1829, \"acRate\": \"52.0%\"}",
"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).",