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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/design-front-middle-back-queue.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 711,
"likes": 712,
"dislikes": 99,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Design Circular Deque\", \"titleSlug\": \"design-circular-deque\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Design Circular Queue\", \"titleSlug\": \"design-circular-queue\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.6K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 24571, \"totalSubmissionRaw\": 43411, \"acRate\": \"56.6%\"}",
"stats": "{\"totalAccepted\": \"24.6K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 24572, \"totalSubmissionRaw\": 43414, \"acRate\": \"56.6%\"}",
"hints": [
"The constraints are low enough for a brute force, single array approach.",
"For an O(1) per method approach, use 2 double-ended queues: one for the first half and one for the second half."