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

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

4
leetcode/originData/maximum-sum-of-distinct-subarrays-with-length-k.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1103,
"likes": 1104,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Max Consecutive Ones III\", \"titleSlug\": \"max-consecutive-ones-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Nice Subarray\", \"titleSlug\": \"longest-nice-subarray\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Optimal Partition of String\", \"titleSlug\": \"optimal-partition-of-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count the Number of Good Subarrays\", \"titleSlug\": \"count-the-number-of-good-subarrays\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"109.2K\", \"totalAcceptedRaw\": 36741, \"totalSubmissionRaw\": 109156, \"acRate\": \"33.7%\"}",
"stats": "{\"totalAccepted\": \"36.8K\", \"totalSubmission\": \"109.3K\", \"totalAcceptedRaw\": 36797, \"totalSubmissionRaw\": 109283, \"acRate\": \"33.7%\"}",
"hints": [
"Which elements change when moving from the subarray of size k that ends at index i to the subarray of size k that ends at index i + 1?",
"Only two elements change, the element at i + 1 is added into the subarray, and the element at i - k + 1 gets removed from the subarray.",