leetcode Balanced Binary Tree
来源:互联网 发布:js replace all 编辑:程序博客网 时间:2024/06/06 03:16
public class Solution {
boolean flag=true;
public boolean isBalanced(TreeNode root) {
if(root==null)
return true;
dep(root);
return flag;
}
public int dep(TreeNode root){
int ldep,rdep;
if(root==null)
return 0;
ldep=dep(root.left);
rdep=dep(root.right);
if(Math.abs(ldep-rdep)>1)
flag=false;
return Math.max(ldep,rdep)+1;
}
boolean flag=true;
public boolean isBalanced(TreeNode root) {
if(root==null)
return true;
dep(root);
return flag;
}
public int dep(TreeNode root){
int ldep,rdep;
if(root==null)
return 0;
ldep=dep(root.left);
rdep=dep(root.right);
if(Math.abs(ldep-rdep)>1)
flag=false;
return Math.max(ldep,rdep)+1;
}
}
还没有搞清楚 递归之间的传参,以及返回顺序。
程序就算判断到子树不为平衡树,也无法立即返回。也要遍历完整树。
想起来 可以在dep函数里面通过flag判断接下来的判断要不要走下去。
public int dep(TreeNode root){
int ldep,rdep;
if(root==null || !flag)
return 0;
ldep=dep(root.left);
rdep=dep(root.right);
if(Math.abs(ldep-rdep)>1)
flag=false;
return Math.max(ldep,rdep)+1;
}
0 0
- LeetCode: Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- LeetCode Balanced Binary Tree
- [Leetcode] Balanced Binary Tree
- LeetCode : Balanced Binary Tree
- LeetCode Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- [Leetcode]Balanced Binary Tree
- [leetcode]Balanced Binary Tree
- Leetcode: Balanced Binary Tree
- LeetCode-Balanced Binary Tree
- LeetCode - Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- LeetCode | Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- 探索并发编程(七)------分布式环境中并发问题
- [网络]局域网两机时间同步
- 线程安全类的设计
- 浏览器向struts2提交list对象
- emulator 创建Android模拟器
- leetcode Balanced Binary Tree
- 五、Html表单标签
- 更快的学习
- centos 6.5 tomcat 6.0安装
- Unable to lock the administration directory (/var/lib/dpkg/)
- 最常用的PHP正则表达式收集整理
- 如何能正常的收取WEB邮件呢?
- java 里面保留字volatile及其与synchronized的区别
- Zabbix - 企业级硬件及网络监控