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": 175,
|
||||
"dislikes": 81,
|
||||
"likes": 178,
|
||||
"dislikes": 82,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[1,2,1,4]\n2\n[6,3,8,1,3,1,2,2]\n4\n[5,3,3,6,3,3]\n3",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5730, \"totalSubmissionRaw\": 15509, \"acRate\": \"36.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"15.6K\", \"totalAcceptedRaw\": 5793, \"totalSubmissionRaw\": 15641, \"acRate\": \"37.0%\"}",
|
||||
"hints": [
|
||||
"The constraints are small enough for a backtrack solution but not any backtrack solution",
|
||||
"If we use a naive n^k don't you think it can be optimized"
|
||||
|
Reference in New Issue
Block a user