coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/remove-stones-to-minimize-the-total.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 276,
"dislikes": 13,
"likes": 293,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Operations to Halve Array Sum\", \"titleSlug\": \"minimum-operations-to-halve-array-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[5,4,9]\n2\n[4,3,6,7]\n3",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 17366, \"totalSubmissionRaw\": 30922, \"acRate\": \"56.2%\"}",
"stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"31.8K\", \"totalAcceptedRaw\": 17968, \"totalSubmissionRaw\": 31773, \"acRate\": \"56.6%\"}",
"hints": [
"Choose the pile with the maximum number of stones each time.",
"Use a data structure that helps you find the mentioned pile each time efficiently.",