本文共 1373 字，大约阅读时间需要 4 分钟。

原题题目

代码实现（首刷自解）

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     struct TreeNode *left; *     struct TreeNode *right; * }; */#define MAX 10100int maxpaths;int visit(struct TreeNode* root,int number){
       if(!root || root->val != number)        return 0;    return fmax(visit(root->left,number),visit(root->right,number)) + 1;}int longestUnivaluePath(struct TreeNode* root){
       if(!root)        return 0;    struct TreeNode* queue[MAX],* pos;    int top = -1,rear = -1,size = 0,paths;    maxpaths = 0;    queue[++rear] = root;    while(rear != top)    {
             size = rear - top;        while(size--)        {
               pos = queue[++top];            paths = 0;            if(pos->left)            {
                   queue[++rear] = pos->left;                if(pos->left->val == pos->val)                    paths = visit(pos->left,pos->val) + visit(pos->right,pos->val);                if(paths > maxpaths)                    maxpaths = paths;            }            if(pos->right)            {
                   queue[++rear] = pos->right;                if(pos->right->val == pos->val && paths <= 0)                    paths = visit(pos->left,pos->val) + visit(pos->right,pos->val);                if(paths > maxpaths)                    maxpaths = paths;            }                   }    }    return maxpaths; }

转载地址：https://love6.blog.csdn.net/article/details/112302359 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！