coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 01:11:42 +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/minimum-difference-in-sums-after-removal-of-elements.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3538, \"totalSubmissionRaw\": 7102, \"acRate\": \"49.8%\"}",
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3541, \"totalSubmissionRaw\": 7113, \"acRate\": \"49.8%\"}",
"hints": [
"The lowest possible difference can be obtained when the sum of the first n elements in the resultant array is minimum, and the sum of the next n elements is maximum.",
"For every index i, think about how you can find the minimum possible sum of n elements with indices lesser or equal to i, if possible.",