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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-number-of-coins-to-be-added.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 3505, \"totalSubmissionRaw\": 7220, \"acRate\": \"48.5%\"}",
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 3520, \"totalSubmissionRaw\": 7242, \"acRate\": \"48.6%\"}",
"hints": [
"Sort the coins array and maintain the smallest sum that is unobtainable by induction.",
"If we don’t use any coins, the smallest integer that we cannot obtain by sum is <code>1</code>. Suppose currently, for a fixed set of the first several coins the smallest integer that we cannot obtain is <code>x + 1</code>, namely we can form all integers in the range <code>[1, x]</code> but not <code>x + 1</code>.",