coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/shuffle-string.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1290,
"dislikes": 244,
"likes": 1353,
"dislikes": 250,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"codeleet\"\n[4,5,6,7,0,2,1,3]\n\"abc\"\n[0,1,2]",
@@ -125,7 +125,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"193.6K\", \"totalSubmission\": \"225.7K\", \"totalAcceptedRaw\": 193553, \"totalSubmissionRaw\": 225676, \"acRate\": \"85.8%\"}",
"stats": "{\"totalAccepted\": \"199.8K\", \"totalSubmission\": \"233K\", \"totalAcceptedRaw\": 199810, \"totalSubmissionRaw\": 233017, \"acRate\": \"85.7%\"}",
"hints": [
"You can create an auxiliary string t of length n.",
"Assign t[indexes[i]] to s[i] for each i from 0 to n-1."