coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/subarrays-distinct-element-sum-of-squares-ii.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 1936, \"totalSubmissionRaw\": 11632, \"acRate\": \"16.6%\"}",
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 1938, \"totalSubmissionRaw\": 11643, \"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."