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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"109.2K\", \"totalSubmission\": \"126.7K\", \"totalAcceptedRaw\": 109219, \"totalSubmissionRaw\": 126673, \"acRate\": \"86.2%\"}",
"stats": "{\"totalAccepted\": \"109.3K\", \"totalSubmission\": \"126.7K\", \"totalAcceptedRaw\": 109267, \"totalSubmissionRaw\": 126730, \"acRate\": \"86.2%\"}",
"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.",