coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 4802, \"totalSubmissionRaw\": 10001, \"acRate\": \"48.0%\"}",
"stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 4812, \"totalSubmissionRaw\": 10017, \"acRate\": \"48.0%\"}",
"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."