Leetcode 1522. Diameter of N-Ary Tree [Python]

对于普通二叉树的diameter。
543. Diameter of Binary Tree
543. https://leetcode.com/problems/diameter-of-binary-tree/

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:def diameterOfBinaryTree(self, root: Optional[TreeNode]) -> int:self.res = 0if not root:return self.resself.getdia(root)return self.resdef getdia(self, root):if not root:return 0left = self.getdia(root.left)right = self.getdia(root.right)self.res = max(self.res, left + right)return 1 + max(left, right)

换到这题，多了很多子树，那其实思路一样，只要维护全局最大值，并且选择最长的两个子树的路径长度加起来就好。用heap实现；注意判断heap里有没有东西。

"""
# Definition for a Node.
class Node:def __init__(self, val=None, children=None):self.val = valself.children = children if children is not None else []
"""class Solution:def diameter(self, root: 'Node') -> int:""":type root: 'Node':rtype: int"""if not root:return 0self.res = float('-inf')self.getdia(root)return self.resdef getdia(self, root):if not root:return 0heap = []for child in root.children:temp = self.getdia(child)heapq.heappush(heap, -temp)first = 0second = 0if heap:first = -1*heapq.heappop(heap)if heap: second = -1*heapq.heappop(heap)self.res = max(self.res, first + second)return 1 + first

Leetcode 1522. Diameter of N-Ary Tree [Python]相关推荐

LeetCode 1522. Diameter of N-Ary Tree（递归）
文章目录 1. 题目 2. 解题 1. 题目 Given a root of an N-ary tree, you need to compute the length of the diameter ...
【同124】LeetCode 543. Diameter of Binary Tree
LeetCode 543. Diameter of Binary Tree Solution1:我的答案思路和方法就是同124题的 /*** Definition for a binary tree ...
【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java
[LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...
leetcode每日一题·买卖股票问题(Python)
leetcode每日一题·买卖股票问题(Python) 买卖股票的最佳时机(股票最大利润) 题目链接给定一个数组 prices ,它的第 i 个元素 prices[i] 表示一支给定股票第 i 天的 ...
LeetCode刷题——哈希表（python语言）
LeetCode刷题--哈希表(python语言) 一.哈希表 1.1 哈希表的概念哈希表,也叫散列表.其实可以很像python的字典,也就是键(key)值(Hash(key))对,最简单也最常用的 ...
[leetcode]623. Add One Row to Tree
[leetcode]623. Add One Row to Tree Analysis 今天要吃柚子-- [每天刷题并不难0.0] Given the root of a binary tree, t ...
leetcode（226）—— Invert Binary Tree（Python/C++）
Invert Binary Tree 二叉树节点定义: struct TreeNode {int val;TreeNode *left;TreeNode *right;TreeNode(int x) ...
Leetcode May Challenge - 05/07: Cousins in Binary Tree(Python)
题目描述 In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k ...
LeetCode 111. Minimum Depth of Binary Tree--Java, Python解法--二叉树最小高度--迭代，递归
题目地址:Minimum Depth of Binary Tree - LeetCode Given a binary tree, find its minimum depth. The minimu ...

Leetcode 1522. Diameter of N-Ary Tree [Python]

Leetcode 1522. Diameter of N-Ary Tree [Python]相关推荐

最新文章

热门文章