298. Binary Tree Longest Consecutive Sequence

Given a binary tree, find the length of the longest consecutive sequence path.

The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to be from parent to child (cannot be the reverse).

For example,

   1
    \
     3
    / \
   2   4
        \
         5

Longest consecutive sequence path is  3-4-5 , so return  3 .

   2
    \
     3
    / 
   2    
  / 
 1

Longest consecutive sequence path is  2-3 ,not 3-2-1 , so return  2 .

找到相连的分支的最大长度，只能从parent 到 child 顺序升序。

自己错过的点：

1 不能用返回值，因为返回值会累加，一定要声明一个另外的变量maxlen，记录最长的连续分支的长度

2 如果root->val != child->val， dfs(child, 1)不是dfs(child,len)不然就又变成累加

3 为空的child可以不处理，不进行dfs就剪枝掉了，不用到判断root == null时返回。

4 不能随便改变len的值，比如len++，这样如果有两个孩子，到遍历right的时候就会变成len+2.

代码如下：

/**
 * 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 maxlen = 1;//必须加max
    int longestConsecutive(TreeNode* root) {
        if (root == NULL) return 0;
        dfs(root, 1);
        return maxlen;
    }
    void dfs(TreeNode* root, int len) {//必须加len，不然返回的是所有连续段的长度之和，不是单一个连续段
        if (root->left != NULL)  {
            if (root->val + 1 == root->left->val) {
                //len++;//不能改变len的值不然会right的len值多了1
                maxlen = max(maxlen, len+1);
                dfs(root->left, len+1);
            }
            else dfs(root->left, 1);
        }
            
        if (root->right != NULL)  {
            if (root->val + 1 == root->right->val) {
                maxlen = max(maxlen, len+1);
                dfs(root->right, len+1);
            }
            else dfs(root->right, 1);
        }
    }
};