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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 480,
"likes": 481,
"dislikes": 194,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"80K\", \"totalSubmission\": \"96.9K\", \"totalAcceptedRaw\": 80050, \"totalSubmissionRaw\": 96865, \"acRate\": \"82.6%\"}",
"stats": "{\"totalAccepted\": \"80.1K\", \"totalSubmission\": \"96.9K\", \"totalAcceptedRaw\": 80102, \"totalSubmissionRaw\": 96928, \"acRate\": \"82.6%\"}",
"hints": [
"Create a hashmap so that D[x] = i whenever B[i] = x. Then, the answer is [D[x] for x in A]."
],