leetcode 687. Longest Univalue Path

最新推荐文章于 2020-07-19 10:34:15 发布

liqinzhe223

最新推荐文章于 2020-07-19 10:34:15 发布

阅读量395

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/liqinzhe11/article/details/78706721

版权

leetcode 专栏收录该内容

280 篇文章 0 订阅

订阅专栏

687. Longest Univalue Path

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:

Output:

Example 2:

Input:

Output:

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

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int longestUnivaluePath(TreeNode* root) 
    {
        ret = 0;
        return_value(root);
        return ret;
    }
    
    int return_value(TreeNode* root) //返回 包括当前节点 连续一致的个数 。不含弯曲的。
    {
        if (!root)  return 0;
        int l = return_value(root->left);
        int r = return_value(root->right);
        
        if ((!root->left || root->left->val == root->val) && (!root->right || root->right->val == root->val)) //左右和当前都相同
        {    
            ret = max(ret, l + r);  //弯曲的情况
            return max(l, r) + 1;
        }
        else if ( (!root->left || root->left->val != root->val) && (!root->right || root->right->val != root->val)) //左右和当前都不同
        {
            return 1;
        }     
        else if (!root->left || root->left->val != root->val) //右边相等。 不然就会进入上面那个else if
        {
            ret = max(ret, r);
            return r + 1;
        }
        else if (!root->right || root->right->val != root->val) //左边相等
        {
            ret = max(ret, l);
            return l + 1;
        }
        return 1;
    }
private:
    int ret;
};