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:
小墨
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

6
leetcode/originData/seat-reservation-manager.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 283,
"dislikes": 21,
"likes": 302,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Design Phone Directory\", \"titleSlug\": \"design-phone-directory\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[\"SeatManager\",\"reserve\",\"reserve\",\"unreserve\",\"reserve\",\"reserve\",\"reserve\",\"reserve\",\"unreserve\"]\n[[5],[],[],[2],[],[],[],[],[5]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 16826, \"totalSubmissionRaw\": 27867, \"acRate\": \"60.4%\"}",
"stats": "{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 18315, \"totalSubmissionRaw\": 29857, \"acRate\": \"61.3%\"}",
"hints": [
"You need a data structure that maintains the states of the seats. This data structure should also allow you to get the first available seat and flip the state of a seat in a reasonable time.",
"You can let the data structure contain the available seats. Then you want to be able to get the lowest element and erase an element, in a reasonable time.",