coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/minimum-sum-of-four-digit-number-after-splitting-digits.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 267,
"dislikes": 32,
"likes": 306,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Add Digits\", \"titleSlug\": \"add-digits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "2932\n4009",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 24204, \"totalSubmissionRaw\": 27561, \"acRate\": \"87.8%\"}",
"stats": "{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"31.4K\", \"totalAcceptedRaw\": 27671, \"totalSubmissionRaw\": 31435, \"acRate\": \"88.0%\"}",
"hints": [
"Notice that the most optimal way to obtain the minimum possible sum using 4 digits is by summing up two 2-digit numbers.",
"We can use the two smallest digits out of the four as the digits found in the tens place respectively.",