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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-equal-sum-of-two-arrays-after-replacing-zeros.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 107,
"dislikes": 15,
"likes": 141,
"dislikes": 17,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,2,0,1,0]\n[6,5,0]\n[2,0,2,0]\n[1,4]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"50.8K\", \"totalAcceptedRaw\": 16007, \"totalSubmissionRaw\": 50773, \"acRate\": \"31.5%\"}",
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"57.2K\", \"totalAcceptedRaw\": 18512, \"totalSubmissionRaw\": 57204, \"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?",