230927刷题记录

230927刷题记录
参考代码代码随想录来刷的

关键词：二叉树、回溯

1 110.平衡二叉树

力扣题目链接
递归
复习一波概念：

• 二叉树节点的深度：指从根节点到该节点的最长简单路径边的条数。
• 二叉树节点的高度：指从该节点到叶子节点的最长简单路径边的条数。

class Solution {
    public boolean isBalanced(TreeNode root) {
        return getHeight(root) != -1;
    }

    private int getHeight(TreeNode root) {
        if (root == null)
            return 0;
        int leftHeight = getHeight(root.left);
        if (leftHeight == -1)
            return -1;
        int rightHeight = getHeight(root.right);
        if (rightHeight == -1)
            return -1;
        if (Math.abs(leftHeight - rightHeight) > 1)
            return -1;
        return Math.max(leftHeight, rightHeight) + 1;
    }
}

迭代
后序遍历➕层序遍历获取结点高度

class Solution {
    public boolean isBalanced(TreeNode root) {
        if (root == null)
            return true;
        ArrayDeque<TreeNode> stack = new ArrayDeque<>();
        TreeNode p = root;
        TreeNode pre = null;
        while (p != null || !stack.isEmpty()) {
            if (p != null) {
                stack.push(p);
                p = p.left;
            } else {
                p = stack.peek();
                if (p.right != null && pre != p.right) {
                    p = p.right;
                } else {
                    p = stack.pop();
                    // visit p
                    int leftHeight = getHeight(p.left);
                    int rightHeight = getHeight(p.right);
                    if (Math.abs(leftHeight - rightHeight) > 1)
                        return false;
                    pre = p;
                    p = null;
                }
            }
        }
        
        return true;
    }

    private int getHeight(TreeNode root) {
        if (root == null)
            return 0;
        Deque<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int depth = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode p = queue.poll();
                if (p.left != null) queue.offer(p.left);
                if (p.right != null) queue.offer(p.right);
            }
            ++depth;
        }
        return depth;
    }
}

2 257. 二叉树的所有路径

力扣题目链接
使用了回溯的思想，第一次接触回溯

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        if (root == null)
            return Collections.emptyList();
        List<Integer> paths = new ArrayList<>();
        List<String> res = new ArrayList<>();
        traversal(root, paths, res);
        return res;
    }
    private void traversal(TreeNode root, List<Integer> paths, List<String> res) {
        paths.add(root.val);
        // 终止条件，叶子
        if (root.left == null && root.right == null) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < paths.size() - 1; i++) {
                sb.append(paths.get(i)).append("->");
            }
            sb.append(paths.get(paths.size() - 1));
            res.add(sb.toString());
        }
        if (root.left != null) {
            traversal(root.left, paths, res);
            paths.remove(paths.size() - 1);
        }
        if (root.right != null) {
            traversal(root.right, paths, res);
            paths.remove(paths.size() - 1);
        }
    }
}

3 404.左叶子之和

力扣题目链接
叶子、左叶子

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int sumOfLeftLeaves(TreeNode root) {
        if (root == null)
            return 0;
        int[] res = {0};
        traversal(root.left, 0, res);
        traversal(root.right, 1, res);
        return res[0];
    }
    private void traversal(TreeNode root, int type, int[] res) {
        if (root == null)
            return;
        if (root.left == null && root.right == null) {
            if (type == 0)
                res[0] += root.val;
            return;
        }
        traversal(root.left, 0, res);
        traversal(root.right, 1, res);
    }
}

4 513.找树左下角的值

力扣题目链接
最后一层、且是最左边的叶子
递归

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int findBottomLeftValue(TreeNode root) {
        int[] depthValue = new int[2];
        traversal(root, 1, depthValue);
        return depthValue[1];
    }
    private void traversal(TreeNode root, int depth, int[] depthValue) {
        if (root == null)
            return;
        if (root.left == null && root.right == null) {
            if (depth > depthValue[0]){
                depthValue[1] = root.val;
                depthValue[0] = depth;
            }
            return;
        }
        traversal(root.left, depth + 1, depthValue);
        traversal(root.right, depth + 1, depthValue);
    }
}

层序遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int findBottomLeftValue(TreeNode root) {
        Deque<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int res = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                root = queue.poll();
                res = root.val;
                if (root.right != null) queue.offer(root.right);
                if (root.left != null) queue.offer(root.left);
            }
        }
        return res;
    }
}