mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 14:12:17 +08:00
update
This commit is contained in:
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 4556, \"totalSubmissionRaw\": 5450, \"acRate\": \"83.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 4562, \"totalSubmissionRaw\": 5458, \"acRate\": \"83.6%\"}",
|
||||
"hints": [
|
||||
"Create a hashmap so that D[x] = i whenever B[i] = x. Then, the answer is [D[x] for x in A]."
|
||||
],
|
||||
|
Reference in New Issue
Block a user