1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2230,
"dislikes": 2187,
"likes": 2284,
"dislikes": 2228,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Contains Duplicate\", \"titleSlug\": \"contains-duplicate\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Contains Duplicate II\", \"titleSlug\": \"contains-duplicate-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,1]\n3\n0\n[1,0,1,1]\n1\n2\n[1,5,9,1,5,9]\n2\n3",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"198.3K\", \"totalSubmission\": \"913.5K\", \"totalAcceptedRaw\": 198282, \"totalSubmissionRaw\": 913487, \"acRate\": \"21.7%\"}",
"stats": "{\"totalAccepted\": \"200.3K\", \"totalSubmission\": \"923K\", \"totalAcceptedRaw\": 200344, \"totalSubmissionRaw\": 923018, \"acRate\": \"21.7%\"}",
"hints": [
"Time complexity O(n logk) - This will give an indication that sorting is involved for k elements.",
"Use already existing state to evaluate next state - Like, a set of k sorted numbers are only needed to be tracked. When we are processing the next number in array, then we can utilize the existing sorted state and it is not necessary to sort next overlapping set of k numbers again."