coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/design-a-number-container-system.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"47.2K\", \"totalAcceptedRaw\": 21229, \"totalSubmissionRaw\": 47227, \"acRate\": \"45.0%\"}",
"stats": "{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"47.2K\", \"totalAcceptedRaw\": 21233, \"totalSubmissionRaw\": 47234, \"acRate\": \"45.0%\"}",
"hints": [
"Use a hash table to efficiently map each number to all of its indices in the container and to map each index to their current number.",
"In addition, you can use ordered set to store all of the indices for each number to solve the find method. Do not forget to update the ordered set according to the change method."