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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5718, \"totalSubmissionRaw\": 15307, \"acRate\": \"37.4%\"}",
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5720, \"totalSubmissionRaw\": 15317, \"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?",