mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-10 09:51:42 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 566,
|
||||
"likes": 567,
|
||||
"dislikes": 8,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Diameter of Binary Tree\", \"titleSlug\": \"diameter-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"42.1K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 42136, \"totalSubmissionRaw\": 57058, \"acRate\": \"73.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"42.1K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 42146, \"totalSubmissionRaw\": 57071, \"acRate\": \"73.8%\"}",
|
||||
"hints": [
|
||||
"For the node i, calculate the height of each of its children and keep the first and second maximum heights (max1_i , max2_i).",
|
||||
"Check all nodes and return max( 2 + max1_i + max2_i )."
|
||||
|
Reference in New Issue
Block a user