Balanced Binary Tree

最新推荐文章于 2024-10-12 22:35:37 发布

violin2696

最新推荐文章于 2024-10-12 22:35:37 发布

阅读量59

点赞数

分类专栏： OJ_leetcode 文章标签： java

本文链接：https://blog.csdn.net/violin2696/article/details/84343555

版权

OJ_leetcode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏


/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if (root == null)
            return true;
        else {
            if (!isBalanced(root.left) || !isBalanced(root.right))
                return false;
            else if (Math.abs(getDepth(root.left) - getDepth(root.right)) <= 1)
                    return true;
                else
                    return false;
        }
    }

    public int getDepth(TreeNode root){
        if (root == null)
            return 0;
        else 
            return Math.max(getDepth(root.left), getDepth(root.right)) + 1;
    }
}

小测试过了大测试超时= = 哎。。。递归果然就是时间效率不高
想了一下发现是isBalanced中已经用isBalanced算过一次深度了之后又算一次深度囧


/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.HashMap;
public class Solution {
    static HashMap<TreeNode, Integer> depths = new HashMap<TreeNode, Integer>();
    public boolean isBalanced(TreeNode root) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if (root == null)
            return true;
        else {
            if (!isBalanced(root.left) || !isBalanced(root.right))
                return false;
            else if (Math.abs(getDepth(root.left) - getDepth(root.right)) <= 1)
                    return true;
                else
                    return false;
        }
    }

    public int getDepth(TreeNode root){
        if (root == null)
            return 0;
        else 
            if (depths.containsKey(root))
                return depths.get(root);
            else{
                depths.put(root, Math.max(getDepth(root.left), getDepth(root.right)) + 1);
                return depths.get(root);
            }
    }
}