coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/maximize-score-after-n-operations.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 357,
"dislikes": 34,
"likes": 375,
"dislikes": 36,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2]\n[3,4,6,8]\n[1,2,3,4,5,6]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 11434, \"totalSubmissionRaw\": 24675, \"acRate\": \"46.3%\"}",
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 11894, \"totalSubmissionRaw\": 25550, \"acRate\": \"46.6%\"}",
"hints": [
"Find every way to split the array until n groups of 2. Brute force recursion is acceptable.",
"Calculate the gcd of every pair and greedily multiply the largest gcds."