您的位置:首页 > 产品设计 > UI/UE

leetcode_687. Longest Univalue Path ? 待解决

2017-11-24 09:56 393 查看
Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.

Note: The length of path between two nodes is represented by the number of edges between them.

Example 1:

Input:

5
/ \
4   5
/ \   \
1   1   5


Output:

2

Example 2:

Input:

1
/ \
4   5
/ \   \
4   4   5


Output:

2

Note: The given binary tree has not more than 10000 nodes. The height of the tree is not more than 1000.

提示:提交代码后,需要用简洁的语言解释一下代码思路~ 谢谢

历史题目和总结见公众号「每日一道算法题」

https://leetcode.com/problems/longest-univalue-path/description/

思路
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode