day17代码随想录|110. 平衡二叉树257. 二叉树的所有路径404. 左叶子之和

最新推荐文章于 2024-06-22 21:53:36 发布

三叁叁

最新推荐文章于 2024-06-22 21:53:36 发布

阅读量244

点赞数

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_56718399/article/details/127822839

版权

day17代码随想录|110. 平衡二叉树257. 二叉树的所有路径404. 左叶子之和

110. 平衡二叉树

class Solution {
    public boolean isBalanced(TreeNode root) {
        return dep(root)!=-1;
    }
    int dep(TreeNode node){
        if(node == null)return 0;
        int left = dep(node.left);
        int right = dep(node.right);
        if(left == -1 || right == -1)return -1;
        return Math.abs(left - right) < 2 ? Math.max(left,right)+1:-1;
    }
}

257. 二叉树的所有路径

class Solution {
    ArrayList<String> ans = new ArrayList<String>();
    StringBuilder sb = new StringBuilder();
    public List<String> binaryTreePaths(TreeNode root) {
        if(root == null)return ans;
        huisu(root);
        return ans;
    }
    void huisu(TreeNode node){
       
        sb.append(node.val);
        if(node.left == null && node.right == null){
            int len = sb.length();
            
            ans.add(new String(sb));
            return;
        }
        if(node.left != null){
            huisu(node.left);
            sb.delete(sb.length()-1,sb.length());
        }
        if(node.right != null){
            huisu(node.right);
            sb.delete(sb.length()-1,sb.length());
        }
        
    }
}

404. 左叶子之和

class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null)return 0;
        int left = sumOfLeftLeaves(root.left);
        int right = sumOfLeftLeaves(root.right);

        int num = 0;
        if(root.left != null && root.left.left== null && root.left.right == null){
            num = root.left.val;
        }
        int sum = num + left + right;
        return sum;
    }
}