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-cn/originData/maximum-sum-of-almost-unique-subarray.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 4032, \"totalSubmissionRaw\": 9197, \"acRate\": \"43.8%\"}",
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 4034, \"totalSubmissionRaw\": 9200, \"acRate\": \"43.8%\"}",
"hints": [
"Use a set or map to keep track of the number of distinct elements.",
"Use 2-pointers to maintain the size, the number of unique elements, and the sum of all the elements in all subarrays of size k from left to right dynamically.****"