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/partition-to-k-equal-sum-subsets.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 4579,
"dislikes": 290,
"likes": 4703,
"dislikes": 302,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Partition Equal Subset Sum\", \"titleSlug\": \"partition-equal-subset-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Number of Ways to Partition an Array\", \"titleSlug\": \"maximum-number-of-ways-to-partition-an-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[4,3,2,3,5,2,1]\n4\n[1,2,3,4]\n3",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"190.6K\", \"totalSubmission\": \"428.4K\", \"totalAcceptedRaw\": 190593, \"totalSubmissionRaw\": 428383, \"acRate\": \"44.5%\"}",
"stats": "{\"totalAccepted\": \"194.3K\", \"totalSubmission\": \"441K\", \"totalAcceptedRaw\": 194315, \"totalSubmissionRaw\": 441007, \"acRate\": \"44.1%\"}",
"hints": [
"We can figure out what target each subset must sum to. Then, let's recursively search, where at each call to our function, we choose which of k subsets the next value will join."
],