LeetCode 110:Balanced Binary Tree(Java)
来源:互联网 发布:软件对比分析报告 编辑:程序博客网 时间:2024/06/10 09:10
思路是使用递归,要用到一个子问题就是求一棵二叉树的深度,也是递归的思想。
这种左右递归的格式对二叉树很有用,要掌握。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public boolean isBalanced(TreeNode root) { if(root == null) return true; //在此处判断可以防止程序在出现false情况后继续运行 if(!(Math.abs(maxDepth(root.left) - maxDepth(root.right)) < 2)) return false; boolean left = isBalanced(root.left); boolean right = isBalanced(root.right); return left && right; } public int maxDepth(TreeNode root) { if(root == null) return 0; int l = maxDepth(root.left); int r = maxDepth(root.right); return l > r ? l + 1 : r + 1; }}
0 0
- LeetCode 110:Balanced Binary Tree(Java)
- [Leetcode] Balanced Binary Tree (Java)
- [LeetCode][Java] Balanced Binary Tree
- LeetCode|Balanced Binary Tree-java
- leetcode:Balanced Binary Tree 【Java】
- LeetCode(110)Balanced Binary Tree
- LeetCode 110 Balanced Binary Tree
- LeetCode: Balanced Binary Tree [110]
- LeetCode 110 Balanced Binary Tree
- [leetcode 110] Balanced Binary Tree
- leetcode-110 Balanced Binary Tree
- leetCode #110 Balanced Binary Tree
- [LeetCode 110]Balanced Binary Tree
- leetcode || 110、Balanced Binary Tree
- Leetcode[110]-Balanced Binary Tree
- LeetCode 110 Balanced Binary Tree
- leetcode[110]:Balanced Binary Tree
- LeetCode(110) Balanced Binary Tree
- Android Studio 获取数字签名信息
- vector iterators incompatible
- jquery事件对Html网页动态生成的元素失效
- 摘抄笔记--《编写高质量代码:改善Java程序的151个建议》
- java环境变量 6,7同 8会自己配置
- LeetCode 110:Balanced Binary Tree(Java)
- Linux通过iptables实现转发
- 可视化数据分析(一) 基于Javascript的D3实践学习
- 局部变量、全局变量
- MJPhotoBrowser一些bug的处理
- 支持sftp协议的libcurl编译
- .bash_profile和.bashrc的区别(如何设置生效)
- Asp.net 学习之路---Http协议
- struts2中各个jar包作用