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/minimum-operations-to-halve-array-sum.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 552,
"likes": 553,
"dislikes": 27,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Remove Stones to Minimize the Total\", \"titleSlug\": \"remove-stones-to-minimize-the-total\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25.4K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 25446, \"totalSubmissionRaw\": 55231, \"acRate\": \"46.1%\"}",
"stats": "{\"totalAccepted\": \"25.5K\", \"totalSubmission\": \"55.3K\", \"totalAcceptedRaw\": 25452, \"totalSubmissionRaw\": 55260, \"acRate\": \"46.1%\"}",
"hints": [
"It is always optimal to halve the largest element.",
"What data structure allows for an efficient query of the maximum element?",