coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-moves-to-make-array-complementary.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 2868, \"totalSubmissionRaw\": 7561, \"acRate\": \"37.9%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 2873, \"totalSubmissionRaw\": 7567, \"acRate\": \"38.0%\"}",
"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?",