mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"56.7K\", \"totalSubmission\": \"111.7K\", \"totalAcceptedRaw\": 56682, \"totalSubmissionRaw\": 111712, \"acRate\": \"50.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"56.7K\", \"totalSubmission\": \"111.8K\", \"totalAcceptedRaw\": 56704, \"totalSubmissionRaw\": 111750, \"acRate\": \"50.7%\"}",
|
||||
"hints": [
|
||||
"Iterate through the cards and store the location of the last occurrence of each number.",
|
||||
"What data structure could you use to get the last occurrence of a number in O(1) or O(log n)?"
|
||||
|
Reference in New Issue
Block a user