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

8
leetcode/originData/coin-change.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 10561,
"dislikes": 256,
"likes": 10877,
"dislikes": 264,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Cost For Tickets\", \"titleSlug\": \"minimum-cost-for-tickets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Value of K Coins From Piles\", \"titleSlug\": \"maximum-value-of-k-coins-from-piles\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Minimum Cost For Tickets\", \"titleSlug\": \"minimum-cost-for-tickets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Value of K Coins From Piles\", \"titleSlug\": \"maximum-value-of-k-coins-from-piles\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Operations to Convert Time\", \"titleSlug\": \"minimum-number-of-operations-to-convert-time\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,5]\n11\n[2]\n3\n[1]\n0",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"932.5K\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 932513, \"totalSubmissionRaw\": 2334798, \"acRate\": \"39.9%\"}",
"stats": "{\"totalAccepted\": \"957.3K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 957347, \"totalSubmissionRaw\": 2389146, \"acRate\": \"40.1%\"}",
"hints": [],
"solution": {
"id": "49",