coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/contains-duplicate-iii.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2227,
"likes": 2230,
"dislikes": 2187,
"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}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"198.2K\", \"totalSubmission\": \"913K\", \"totalAcceptedRaw\": 198161, \"totalSubmissionRaw\": 912960, \"acRate\": \"21.7%\"}",
"stats": "{\"totalAccepted\": \"198.3K\", \"totalSubmission\": \"913.5K\", \"totalAcceptedRaw\": 198282, \"totalSubmissionRaw\": 913487, \"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."