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

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

4
leetcode/originData/maximum-segment-sum-after-removals.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 432,
"likes": 433,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"16.1K\", \"totalAcceptedRaw\": 7811, \"totalSubmissionRaw\": 16125, \"acRate\": \"48.4%\"}",
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"16.1K\", \"totalAcceptedRaw\": 7816, \"totalSubmissionRaw\": 16132, \"acRate\": \"48.5%\"}",
"hints": [
"Use a sorted data structure to collect removal points and store the segments.",
"Use a heap or priority queue to store segment sums and their corresponding boundaries.",