coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 167,
"dislikes": 34,
"likes": 177,
"dislikes": 35,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Coin Change\", \"titleSlug\": \"coin-change\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,4,10]\n19\n[1,4,10,5,7,19]\n19\n[1,1,1]\n20",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 10077, \"totalSubmissionRaw\": 19693, \"acRate\": \"51.2%\"}",
"stats": "{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 10303, \"totalSubmissionRaw\": 20114, \"acRate\": \"51.2%\"}",
"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>.",