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/minimum-moves-to-make-array-complementary.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 422,
"dislikes": 53,
"likes": 437,
"dislikes": 54,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,4,3]\n4\n[1,2,2,1]\n2\n[1,2,1,2]\n2",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5720, \"totalSubmissionRaw\": 15317, \"acRate\": \"37.3%\"}",
"stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5791, \"totalSubmissionRaw\": 15545, \"acRate\": \"37.3%\"}",
"hints": [
"Given a target sum x, each pair of nums[i] and nums[n-1-i] would either need 0, 1, or 2 modifications.",
"Can you find the optimal target sum x value such that the sum of modifications is minimized?",