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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/[no content]find-anagram-mappings.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 481,
"dislikes": 194,
"likes": 485,
"dislikes": 195,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[12,28,46,32,50]\n[50,12,32,46,28]\n[84,46]\n[84,46]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"80.1K\", \"totalSubmission\": \"96.9K\", \"totalAcceptedRaw\": 80102, \"totalSubmissionRaw\": 96928, \"acRate\": \"82.6%\"}",
"stats": "{\"totalAccepted\": \"80.8K\", \"totalSubmission\": \"97.7K\", \"totalAcceptedRaw\": 80751, \"totalSubmissionRaw\": 97669, \"acRate\": \"82.7%\"}",
"hints": [
"Create a hashmap so that D[x] = i whenever B[i] = x. Then, the answer is [D[x] for x in A]."
],