687. Longest Univalue Path（C语言）

晴宝儿

已于 2022-11-06 00:07:40 修改

阅读量146

点赞数

分类专栏：二叉树文章标签： c语言算法数据结构 leetcode

于 2022-11-06 00:06:50 首次发布

本文链接：https://blog.csdn.net/weixin_42413356/article/details/127711199

版权

二叉树专栏收录该内容

21 篇文章 0 订阅

订阅专栏

687. Longest Univalue Path（C语言）

题目

Given the root of a binary tree, return 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.

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

Example 1:
在这里插入图片描述
Input: root = [5,4,5,1,1,null,5]
Output: 2
Explanation: The shown image shows that the longest path of the same value (i.e. 5).

Example 2:
在这里插入图片描述
Input: root = [1,4,5,4,4,null,5]
Output: 2
Explanation: The shown image shows that the longest path of the same value (i.e. 4).

Constraints:
The number of nodes in the tree is in the range [0, 104].
-1000 <= Node.val <= 1000
The depth of the tree will not exceed 1000.

解答

递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int longest_num;
void Tra(struct TreeNode* root, int *present_longest)
{
    if(root == NULL)
    {
        *present_longest = 0;
        return ;
    }

    int left_longest, right_longest;
    Tra(root->left, &left_longest);
    Tra(root->right, &right_longest);

	//考虑到要使用子树的值，所以要先判断子树是否为NULL
    if(root->left == NULL && root->right == NULL)
    {
        *present_longest = 0;
    }
    else if(root->left == NULL)
    {
        if(root->val == root->right->val)
            *present_longest = right_longest + 1;
        else
            *present_longest = 0;
    }
    else if(root->right == NULL)
    {
        if(root->val == root->left->val)
            *present_longest = left_longest + 1;
        else
            *present_longest = 0;
    }
    else
    {
        if(root->val == root->left->val && root->val == root->right->val)
        {
            *present_longest = left_longest + right_longest + 2;
            if(longest_num < *present_longest)
                longest_num = *present_longest;
            *present_longest = left_longest >= right_longest ? (left_longest+1) : (right_longest+1); 
        }
        else if(root->val == root->left->val)
            *present_longest = left_longest + 1;
        else if(root->val == root->right->val)
            *present_longest = right_longest + 1;
        else
            *present_longest = 0;
    }

    if(longest_num < *present_longest)
        longest_num = *present_longest;
}
int longestUnivaluePath(struct TreeNode* root){
    longest_num = 0;
    int present_longest;
    Tra(root, &present_longest);
    return longest_num;
}