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

6
leetcode/originData/[no content]number-of-unique-flavors-after-sharing-k-candies.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 41,
"dislikes": 0,
"likes": 42,
"dislikes": 1,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Remove Boxes\", \"titleSlug\": \"remove-boxes\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Subarrays with K Different Integers\", \"titleSlug\": \"subarrays-with-k-different-integers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,2,3,4,3]\n3\n[2,2,2,2,3,3]\n2\n[2,4,5]\n0",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"2K\", \"totalAcceptedRaw\": 1168, \"totalSubmissionRaw\": 2001, \"acRate\": \"58.4%\"}",
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1299, \"totalSubmissionRaw\": 2251, \"acRate\": \"57.7%\"}",
"hints": [
"For every group of k consecutive candies, count the number of unique flavors not inside that group. Return the largest number of unique flavors.",
"When calculating an adjacent group of k consecutive candies, can you use some of your previous calculations?",