[Swift]LeetCode298. 二叉树最长连续序列 $ Binary Tree Longest Consecutive Sequence

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10692670.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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,not3-2-1, so return 2.

---

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

路径是指沿着父子连接从某个起始节点到树中任何节点的任何节点序列。最长的连续路径必须是从父路径到子路径（不能是反向路径）。

例如，

   1
    
     3
    / 
   2   4
        
         5

最长的连续序列路径是3-4-5，所以返回3。

   2
    
     3
    / 
   2    
  / 
 1

最长的连续序列路径是2-3，而不是3-2-1，所以返回2。

---

Solution:

public class TreeNode {
    public var val: Int
    public var left: TreeNode?
    public var right: TreeNode?
    public init(_ val: Int) {
        self.val = val
        self.left = nil
        self.right = nil
    }
}

class Solution {
    func longestConsecutive(_ root: TreeNode?) -> Int {
        var num:Int = 0
        return helper(root,nil,num)
    }
    
    func helper(_ root: TreeNode?,_ p: TreeNode?,_ res:Int) -> Int
    {
        var res = res
        if root == nil {return res}
        res = (p != nil && root!.val == p!.val + 1) ? res + 1 : 1
        return max(res, max(helper(root?.left, root, res), helper(root?.right, root, res)))
    }
}