coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/maximum-score-from-removing-stones.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 466,
"dislikes": 33,
"likes": 493,
"dislikes": 34,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "2\n4\n6\n4\n4\n6\n1\n8\n8",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 20528, \"totalSubmissionRaw\": 31607, \"acRate\": \"64.9%\"}",
"stats": "{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"32.8K\", \"totalAcceptedRaw\": 21363, \"totalSubmissionRaw\": 32766, \"acRate\": \"65.2%\"}",
"hints": [
"It's optimal to always remove one stone from the biggest 2 piles",
"Note that the limits are small enough for simulation"