public boolean isBalanced(TreeNode root) { if(root==null) return true; int leftH=getHeight(root.left); int rightH=getHeight(root.right); int diff = leftH - rightH; if (diff>1 || diff<-1) { return false; } else { return isBalanced(root.right)&&isBalanced(root.left); } } public int getHeight(TreeNode root) { if (root==null) { return 0; } return 1+Math.max(getHeight(root.right),getHeight(root.left)); }
Java 110 leetcode
最新推荐文章于 2024-06-13 21:39:40 发布