coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 8213, \"totalSubmissionRaw\": 20997, \"acRate\": \"39.1%\"}",
"stats": "{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 8213, \"totalSubmissionRaw\": 21003, \"acRate\": \"39.1%\"}",
"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?",