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-equal-sum-of-two-arrays-after-replacing-zeros.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"57.2K\", \"totalAcceptedRaw\": 18512, \"totalSubmissionRaw\": 57204, \"acRate\": \"32.4%\"}",
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"57.3K\", \"totalAcceptedRaw\": 18537, \"totalSubmissionRaw\": 57265, \"acRate\": \"32.4%\"}",
"hints": [
"Consider we replace all the 0’s with 1’s on both arrays, the answer will be <code>-1</code> if there was no <code>0</code> in the array with the smaller sum of elements.",
"Otherwise, how can you update the value of exactly one of these <code>1</code>’s to make the sum of the two arrays equal?",