[LeetCode] Binary Tree Longest Consecutive Sequence

本文轉載自查看原文 2015-10-30 16:55 2104 LeetCode Solutions

Problem Description:

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,

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

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

This post shares an elegant C++ solution, just in 4 lines. The code is as follows.

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     int longestConsecutive(TreeNode* root) {
13         return longest(root, NULL, 0);
14     }
15 private:
16     int longest(TreeNode* now, TreeNode* parent, int len) {
17         if (!now) return len;
18         len = (parent && now->val == parent->val + 1) ? len + 1 : 1;
19         return max(len, max(longest(now->left, now, len), longest(now->right, now, len)));
20     }
21 };

免責聲明！

本站轉載的文章為個人學習借鑒使用，本站對版權不負任何法律責任。如果侵犯了您的隱私權益，請聯系本站郵箱yoyou2525@163.com刪除。

猜您在找 [LeetCode] Binary Tree Longest Consecutive Sequence II 二叉樹最長連續序列之二 [LeetCode] Longest Consecutive Sequence 求最長連續序列 [Leetcode] Balanced Binary Tree LeetCode Balanced Binary Tree 【leetcode】1027. Longest Arithmetic Sequence [leetcode]Balanced Binary Tree @ Python [LeetCode] Lowest Common Ancestor of a Binary Tree [LeetCode] Closest Binary Search Tree Value [LeetCode] Closest Binary Search Tree Value II [leetcode]Binary Tree Level Order Traversal @ Python