1
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
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 279,
"likes": 281,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Subarrays With Median K\", \"titleSlug\": \"count-subarrays-with-median-k\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6612, \"totalSubmissionRaw\": 14438, \"acRate\": \"45.8%\"}",
"stats": "{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6612, \"totalSubmissionRaw\": 14439, \"acRate\": \"45.8%\"}",
"hints": [
"Iterate over all subarrays in a nested fashion. Namely, for each left endpoint, start from nums[left] and add elements nums[left + 1], nums[left + 2], etc.",
"To keep track of the imbalance value, maintain a set of added elements.",