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-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/maximize-score-after-n-operations.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 356,
"likes": 357,
"dislikes": 34,
"isLiked": null,
"similarQuestions": "[]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"24.6K\", \"totalAcceptedRaw\": 11413, \"totalSubmissionRaw\": 24638, \"acRate\": \"46.3%\"}",
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 11434, \"totalSubmissionRaw\": 24675, \"acRate\": \"46.3%\"}",
"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."