mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1479,
|
||||
"likes": 1480,
|
||||
"dislikes": 14,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Depth of Binary Tree\", \"titleSlug\": \"maximum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Shortest Path to Get Food\", \"titleSlug\": \"shortest-path-to-get-food\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"All Nodes Distance K in Binary Tree\", \"titleSlug\": \"all-nodes-distance-k-in-binary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count the Number of Infection Sequences\", \"titleSlug\": \"count-the-number-of-infection-sequences\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"36.3K\", \"totalSubmission\": \"61.9K\", \"totalAcceptedRaw\": 36339, \"totalSubmissionRaw\": 61890, \"acRate\": \"58.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"36.4K\", \"totalSubmission\": \"61.9K\", \"totalAcceptedRaw\": 36366, \"totalSubmissionRaw\": 61934, \"acRate\": \"58.7%\"}",
|
||||
"hints": [
|
||||
"Convert the tree to an undirected graph to make it easier to handle.",
|
||||
"Use BFS starting at the start node to find the distance between each node and the start node. The answer is the maximum distance."
|
||||
|
Reference in New Issue
Block a user