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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -179,7 +179,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"57.5K\", \"totalSubmission\": \"98.9K\", \"totalAcceptedRaw\": 57544, \"totalSubmissionRaw\": 98854, \"acRate\": \"58.2%\"}",
"stats": "{\"totalAccepted\": \"57.5K\", \"totalSubmission\": \"98.9K\", \"totalAcceptedRaw\": 57548, \"totalSubmissionRaw\": 98862, \"acRate\": \"58.2%\"}",
"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."