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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]design-most-recently-used-queue.json
View File

@@ -58,7 +58,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"743\", \"totalSubmission\": \"921\", \"totalAcceptedRaw\": 743, \"totalSubmissionRaw\": 921, \"acRate\": \"80.7%\"}",
"stats": "{\"totalAccepted\": \"744\", \"totalSubmission\": \"922\", \"totalAcceptedRaw\": 744, \"totalSubmissionRaw\": 922, \"acRate\": \"80.7%\"}",
"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.",