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/originData/[no content]sum-of-special-evenly-spaced-elements-in-array.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 17,
"dislikes": 16,
"dislikes": 18,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[0,1,2,3,4,5,6,7]\n[[0,3],[5,1],[4,2]]\n[100,200,101,201,102,202,103,203]\n[[0,7]]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"951\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 951, \"totalSubmissionRaw\": 1829, \"acRate\": \"52.0%\"}",
"stats": "{\"totalAccepted\": \"967\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 967, \"totalSubmissionRaw\": 1858, \"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).",