mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"28.5K\", \"totalAcceptedRaw\": 17413, \"totalSubmissionRaw\": 28470, \"acRate\": \"61.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"28.5K\", \"totalAcceptedRaw\": 17424, \"totalSubmissionRaw\": 28483, \"acRate\": \"61.2%\"}",
|
||||
"hints": [
|
||||
"Can we generate all possible partitions of a number?",
|
||||
"Use a recursive algorithm that splits the number into two parts, generates all possible partitions of each part recursively, and then combines them in all possible ways."
|
||||
|
Reference in New Issue
Block a user