coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 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": 181,
"likes": 185,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Remove Stones to Minimize the Total\", \"titleSlug\": \"remove-stones-to-minimize-the-total\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"23.1K\", \"totalAcceptedRaw\": 9858, \"totalSubmissionRaw\": 23052, \"acRate\": \"42.8%\"}",
"stats": "{\"totalAccepted\": \"10K\", \"totalSubmission\": \"23.4K\", \"totalAcceptedRaw\": 10033, \"totalSubmissionRaw\": 23418, \"acRate\": \"42.8%\"}",
"hints": [
"It is always optimal to halve the largest element.",
"What data structure allows for an efficient query of the maximum element?",