LeetCode 298 二叉树最长连续序列

【题目】

给定一个二叉树，求最长连续序列的长度。

连续序列是一条父节点到子节点路径，路径上的数连续递增(子节点的数比父节点大1)。

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.

【思路】

先序遍历。对于每个遍历到的节点，判断节点值是否比父节点值大1。如果是则长度加1，否则长度重置为1，然后更新结果ans，再递归调用左右子节点即可。

class Solution {
public:
    int longestConsecutive(TreeNode* root) {