coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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

4
leetcode/originData/maximum-tastiness-of-candy-basket.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 810,
"likes": 809,
"dislikes": 106,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Container With Most Water\", \"titleSlug\": \"container-with-most-water\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Sliding Window Maximum\", \"titleSlug\": \"sliding-window-maximum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 16421, \"totalSubmissionRaw\": 26083, \"acRate\": \"63.0%\"}",
"stats": "{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 16430, \"totalSubmissionRaw\": 26101, \"acRate\": \"62.9%\"}",
"hints": [
"The answer is binary searchable.",
"For some x, we can use a greedy strategy to check if it is possible to pick k distinct candies with tastiness being at least x.",