coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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-cn/originData/equal-sum-arrays-with-minimum-number-of-operations.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25.4K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 25377, \"totalSubmissionRaw\": 44922, \"acRate\": \"56.5%\"}",
"stats": "{\"totalAccepted\": \"25.4K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 25385, \"totalSubmissionRaw\": 44933, \"acRate\": \"56.5%\"}",
"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."