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/make-two-arrays-equal-by-reversing-sub-arrays.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 690,
"dislikes": 107,
"likes": 716,
"dislikes": 108,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4]\n[2,4,1,3]\n[7]\n[7]\n[3,7,9]\n[3,7,11]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"114.2K\", \"totalAcceptedRaw\": 82827, \"totalSubmissionRaw\": 114151, \"acRate\": \"72.6%\"}",
"stats": "{\"totalAccepted\": \"85K\", \"totalSubmission\": \"117.3K\", \"totalAcceptedRaw\": 85027, \"totalSubmissionRaw\": 117278, \"acRate\": \"72.5%\"}",
"hints": [
"Each element of target should have a corresponding element in arr, and if it doesn't have a corresponding element, return false.",
"To solve it easiely you can sort the two arrays and check if they are equal."