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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/subarrays-distinct-element-sum-of-squares-ii.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 98,
"dislikes": 5,
"likes": 117,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,1]\n[2,2]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 9894, \"acRate\": \"14.2%\"}",
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 1936, \"totalSubmissionRaw\": 11632, \"acRate\": \"16.6%\"}",
"hints": [
"Consider the sum of the count of distinct values of subarrays ending with index <code>i</code>, let’s call it <code>sum</code>. Now if you need the sum of all subarrays ending with index <code>i + 1</code> think how it can be related to <code>sum</code> and what extra will be needed to add to this.",
"You can find that extra sum using the segment tree."