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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/equal-sum-arrays-with-minimum-number-of-operations.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 478,
"dislikes": 14,
"likes": 496,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Dice Rolls With Target Sum\", \"titleSlug\": \"number-of-dice-rolls-with-target-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5,6]\n[1,1,2,2,2,2]\n[1,1,1,1,1,1,1]\n[6]\n[6,6]\n[1]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.3K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 14329, \"totalSubmissionRaw\": 27866, \"acRate\": \"51.4%\"}",
"stats": "{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 14712, \"totalSubmissionRaw\": 28648, \"acRate\": \"51.4%\"}",
"hints": [
"Let's note that we want to either decrease the sum of the array with a larger sum or increase the array's sum with the smaller sum.",
"You can maintain the largest increase or decrease you can make in a binary search tree and each time get the maximum one."