LeetCode Weekly Contest 52 Longest Univalue Path（链表dfs）

题目：https://leetcode.com/contest/leetcode-weekly-contest-52/problems/longest-univalue-path/
题意：给你一个二叉树，让找一条最长路径，这条路径上所有的val相等
思路：dfs
链表忘光了啊，一直RE……
不能自己编译，好蛋疼啊……
代码：

/**
 * 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 dfs(TreeNode *x,int &cnt){
        if(x == nullptr)
            return 0;
        int lnum = dfs(x->left,cnt);
        int rnum = dfs(x->right,cnt);
        int l = 0,r = 0,maxn = 1;
        if(x->left && x->val == x->left->val){
            maxn = max(maxn,lnum+1);
            l = lnum;
        }
        if(x->right && x->val == x->right->val){
            maxn = max(maxn,rnum+1);
            r = rnum;
        }
        cnt = max(cnt,l+r);
        return maxn;
    }
    int longestUnivaluePath(TreeNode* root) {
        int cnt = 0;
        dfs(root,cnt);
        return cnt;
    }
};