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 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/seat-reservation-manager.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 280,
"likes": 283,
"dislikes": 21,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Design Phone Directory\", \"titleSlug\": \"design-phone-directory\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.7K\", \"totalSubmission\": \"27.7K\", \"totalAcceptedRaw\": 16696, \"totalSubmissionRaw\": 27710, \"acRate\": \"60.3%\"}",
"stats": "{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 16826, \"totalSubmissionRaw\": 27867, \"acRate\": \"60.4%\"}",
"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.",