leetcode 298: Binary Tree Longest Consecutive Sequence
2015-10-29 16:35
567 查看
Binary Tree Longest Consecutive Sequence
Total Accepted:437 Total Submissions:
1351 Difficulty: Medium
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.
[CODE]
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { int max = 1; public int longestConsecutive(TreeNode root) { if(root==null) return 0; rec(root, 1); return max; } private void rec(TreeNode n, int c) { if(n.left!=null) { if(n.val+1 == n.left.val) {rec(n.left, c+1); max = Math.max(max, c+1);} else rec(n.left, 1); } if(n.right!=null) { if(n.val+1 == n.right.val) {rec(n.right, c+1); max = Math.max(max, c+1);} else rec(n.right, 1); } } }
相关文章推荐
- String、StringBuffer与StringBuilder之间区别
- Java String之String和CharSequence、StringBuilder和StringBuffer的区别(1)
- StringBuilder
- 基于easyui开发Web版Activiti流程定制器详解(六)——Draw2d详解(二)
- AMD发布LiquidVR SDK 1.0 提供即插即用的虚拟现实体验--看看最新的虚拟现实
- 基于easyui开发Web版Activiti流程定制器详解(六)——Draw2d的扩展(一)
- 基于easyui开发Web版Activiti流程定制器详解(五)——Draw2d详解(一)
- 基于easyui开发Web版Activiti流程定制器详解(四)——页面结构(下)
- 基于easyui开发Web版Activiti流程定制器详解(三)——页面结构(上)
- 基于easyui开发Web版Activiti流程定制器详解(二)——文件列表
- 基于easyui开发Web版Activiti流程定制器详解(一)——目录结构
- 使用easyui框架form控件,单选按钮radio或复选框checkbox样式问题
- ViewConfiguration 使用
- Android studio导入项目报错failed to find Build Tools revision 19.0.0
- android上的UI自动化测试的UIAutomator的讲解
- request获取客户端ip
- SQL SERVER 分页(Paging a Query with SQL Server)
- Java Collections.asLifoQueue(deque)方法介绍
- UILabel高度的自适应以及UITableViewCell的高度自适应
- easyui tree节点取消选择方法