coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/maximum-split-of-positive-even-integers.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 306,
"dislikes": 37,
"likes": 348,
"dislikes": 39,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "12\n7\n28",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 13245, \"totalSubmissionRaw\": 24512, \"acRate\": \"54.0%\"}",
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 15272, \"totalSubmissionRaw\": 27617, \"acRate\": \"55.3%\"}",
"hints": [
"First, check if finalSum is divisible by 2. If it isn’t, then we cannot split it into even integers.",
"Let k be the number of elements in our split. As we want the maximum number of elements, we should try to use the first k - 1 even elements to grow our sum as slowly as possible.",