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-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/minimum-sum-of-four-digit-number-after-splitting-digits.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 264,
"likes": 267,
"dislikes": 32,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Add Digits\", \"titleSlug\": \"add-digits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24K\", \"totalSubmission\": \"27.3K\", \"totalAcceptedRaw\": 23972, \"totalSubmissionRaw\": 27293, \"acRate\": \"87.8%\"}",
"stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 24204, \"totalSubmissionRaw\": 27561, \"acRate\": \"87.8%\"}",
"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.",