【Leetcode刷题笔记】687. Longest Univalue Path 寻找单路径二叉树中节点值相同的边的个数

最新推荐文章于 2020-12-30 16:40:09 发布

乐观的Zqq

最新推荐文章于 2020-12-30 16:40:09 发布

阅读量128

点赞数

分类专栏：【leetcode刷题日记】 leetcode

本文链接：https://blog.csdn.net/qq_34326845/article/details/88046890

版权

【leetcode刷题日记】同时被 2 个专栏收录

40 篇文章 0 订阅

订阅专栏

leetcode

39 篇文章 0 订阅

订阅专栏

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.

int longestUnivaluePath(TreeNode* root) {
        if(!root)return 0;
        int cur = 0;
        dfs(root,cur);
        return cur;
        
    }
    int dfs(TreeNode* root,int& cur){
        int l = root->left?dfs(root->left,cur):0;
        int r = root->right?dfs(root->right,cur):0;
        l=(root->left && root->left->val==root->val) ? l+1 : 0;
        r=(root->right && root->right->val==root->val) ? r+1 : 0;
        cur=max(cur,l+r);
        return max(l,r);
    }