[leetcode]Balanced Binary Tree
来源:互联网 发布:福州技术支持一九网络 编辑:程序博客网 时间:2024/06/05 22:57
<pre name="code" class="javascript">自己的解法可以减少递归调用的次数,通过flag标志先判断 是否要递归。
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; if(!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
- Java学习笔记之 File构造方法
- 黑马程序员——Java基础——对象序列化、管道流、RandomAccessFile类、操作基本数据类型的流对象、字符编码
- 新版JQuery Mobile返回按钮
- P122.17
- input IDC
- [leetcode]Balanced Binary Tree
- Getting iWork for Free on Older Macs
- hdu 1423 Greatest Common Increasing Subsequence(最长公共递增子序列lcis)
- 第8周项目3(1)分数类中的运算符重载
- 美好时光之大四下学期实验室实习
- HDOJ Calculation 2 3501(eular函数)
- java解惑--跨包方法覆写
- 使用JDBC对数据库进行CRUD(二)
- Linux怎么清空与删除指定大小文件