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/[no content]design-most-recently-used-queue.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 146,
"likes": 148,
"dislikes": 12,
"isLiked": null,
"similarQuestions": "[{\"title\": \"LRU Cache\", \"titleSlug\": \"lru-cache\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -58,7 +58,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 5346, \"totalSubmissionRaw\": 6763, \"acRate\": \"79.0%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 5366, \"totalSubmissionRaw\": 6787, \"acRate\": \"79.1%\"}",
"hints": [
"You can store the data in an array and apply each fetch by moving the ith element to the end of the array (i.e, O(n) per operation).",
"A better way is to use the square root decomposition technique.",