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": 945,
|
||||
"dislikes": 81,
|
||||
"likes": 976,
|
||||
"dislikes": 83,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[\"TreeAncestor\",\"getKthAncestor\",\"getKthAncestor\",\"getKthAncestor\"]\n[[7,[-1,0,0,1,1,2,2]],[3,1],[5,2],[6,3]]",
|
||||
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"19.6K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 19635, \"totalSubmissionRaw\": 58755, \"acRate\": \"33.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"60.1K\", \"totalAcceptedRaw\": 20063, \"totalSubmissionRaw\": 60053, \"acRate\": \"33.4%\"}",
|
||||
"hints": [
|
||||
"The queries must be answered efficiently to avoid time limit exceeded verdict.",
|
||||
"Use sparse table (dynamic programming application) to travel the tree upwards in a fast way."
|
||||
|
Reference in New Issue
Block a user