coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +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

2
leetcode-cn/originData/maximize-score-after-n-operations.json
View File

@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"5.3K\", \"totalAcceptedRaw\": 2769, \"totalSubmissionRaw\": 5288, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"5.4K\", \"totalAcceptedRaw\": 2860, \"totalSubmissionRaw\": 5435, \"acRate\": \"52.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."