mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 243,
|
||||
"dislikes": 30,
|
||||
"likes": 248,
|
||||
"dislikes": 34,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[-1,0,1]\n[-1,0,0,1,2]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 3527, \"totalSubmissionRaw\": 7320, \"acRate\": \"48.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 3597, \"totalSubmissionRaw\": 7464, \"acRate\": \"48.2%\"}",
|
||||
"hints": [
|
||||
"Use dynamic programming.",
|
||||
"Let dp[i] be the number of ways to solve the problem for the subtree of node i.",
|
||||
|
Reference in New Issue
Block a user