mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"113.1K\", \"totalSubmission\": \"163.9K\", \"totalAcceptedRaw\": 113076, \"totalSubmissionRaw\": 163874, \"acRate\": \"69.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"113.1K\", \"totalSubmission\": \"163.9K\", \"totalAcceptedRaw\": 113085, \"totalSubmissionRaw\": 163889, \"acRate\": \"69.0%\"}",
|
||||
"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.",
|
||||
|
Reference in New Issue
Block a user