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-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-cost-of-buying-candies-with-discount.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 207,
"likes": 209,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Array Partition I\", \"titleSlug\": \"array-partition-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Absolute Difference\", \"titleSlug\": \"minimum-absolute-difference\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"32.8K\", \"totalAcceptedRaw\": 19866, \"totalSubmissionRaw\": 32813, \"acRate\": \"60.5%\"}",
"stats": "{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"32.9K\", \"totalAcceptedRaw\": 19938, \"totalSubmissionRaw\": 32947, \"acRate\": \"60.5%\"}",
"hints": [
"If we consider costs from high to low, what is the maximum cost of a single candy that we can get for free?",
"How can we generalize this approach to maximize the costs of the candies we get for free?",