Leetcode - Maximum Average Subtree
Leetcode - Bitwise AND of Numbers Range

Leetcode - Binary Tree Longest Consecutive Sequence

violet posted @ Apr 22, 2020 05:37:07 AM in 算法 with tags Algorithm Golang tree , 245 阅读

https://leetcode.com/problems/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).

Example 1:

Input:

   1
    \
     3
    / \
   2   4
        \
         5

Output: 3

 

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func longestConsecutive(root *TreeNode) int {
    if root == nil {
        return 0
    }
    maxLength := 0
    
    dfs(root, nil, 0, &maxLength)
    
    return maxLength
}

func dfs(node, parent *TreeNode, length int, maxLength *int) {
    if node == nil {
        return
    }
    if parent != nil && parent.Val + 1 == node.Val {
        length++
    } else {
        length = 1
    }
    
    *maxLength = max(*maxLength, length)
    dfs(node.Left, node, length, maxLength)
    dfs(node.Right, node, length, maxLength)
}

func max(a, b int) int {
    if a > b {
        return a
    }
    
    return b
}

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter