coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
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": 148,
"likes": 157,
"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.4K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 5366, \"totalSubmissionRaw\": 6787, \"acRate\": \"79.1%\"}",
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 5643, \"totalSubmissionRaw\": 7156, \"acRate\": \"78.9%\"}",
"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.",