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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 112,
"dislikes": 49,
"likes": 113,
"dislikes": 54,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[6,2,3,4]\r\n[1,6,3,4,3,5]\r",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 9947, \"totalSubmissionRaw\": 19755, \"acRate\": \"50.4%\"}",
"stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"19.9K\", \"totalAcceptedRaw\": 10051, \"totalSubmissionRaw\": 19940, \"acRate\": \"50.4%\"}",
"hints": [
"Try to simulate the process.",
"For every iteration, find the new array using the old one and the given rules."