DFS_298_二叉树最长连续序列

题目描述

思路

• dfs，若在递归过程中 不满足要求，长度重新置为1

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def longestConsecutive(self, root: TreeNode) -> int:
        if not root: return 0
        self.ans = 0

        def dfs(node, parent, parent_path):
            if not node: return
            cur = 1  # 如果下面不成立，cur为1
            if node.val == parent:
                cur += parent_path

            self.ans = max(self.ans, cur)
            dfs(node.left, node.val+1, cur)
            dfs(node.right, node.val+1, cur)

        dfs(root, root.val+1, 1)  # 由于root没有父节点, 这里第3个参数值可随意设置
        return self.ans