coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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-the-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 2205,
"dislikes": 169,
"likes": 2282,
"dislikes": 170,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,5,1,3,4,7]\n3\n[1,2,3,4,4,3,2,1]\n4\n[1,1,2,2]\n2",
@@ -119,7 +119,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"302.9K\", \"totalSubmission\": \"343K\", \"totalAcceptedRaw\": 302933, \"totalSubmissionRaw\": 342952, \"acRate\": \"88.3%\"}",
"stats": "{\"totalAccepted\": \"309.5K\", \"totalSubmission\": \"350.4K\", \"totalAcceptedRaw\": 309530, \"totalSubmissionRaw\": 350433, \"acRate\": \"88.3%\"}",
"hints": [
"Use two pointers to create the new array of 2n elements. The first starting at the beginning and the other starting at (n+1)th position. Alternate between them and create the new array."
],