代码随想录算法训练营第十八天

二叉树相关

今天的题目按照递归做法基本是一种套路

513.找树左下角的值

参考文章
题目链接

个人题解

class Solution {
    public int findBottomLeftValue(TreeNode root) {
        LinkedList<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int res = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                if (i == 0) {
                    res = node.val;
                }
                if (node.left != null) {
                    queue.offer(node.left);
                }
                if (node.right != null) {
                    queue.offer(node.right);
                }
            }
        }

        return res;

    }
}

112. 路径总和

参考文章
题目链接

个人题解

106.从中序与后序遍历序列构造二叉树

参考文章
题目链接

个人题解

class Solution {
     public boolean hasPathSum(TreeNode root, int targetSum) {
         if (root == null) {
             return false;
         }
         targetSum -= root.val;
         if (root.left == null && root.right == null) {
             return targetSum == 0;
         }
         if (root.left != null) {
             boolean left = hasPathSum(root.left, targetSum);
             if(left){
                 return true;
             }
         }
         if (root.right != null) {
             boolean right = hasPathSum(root.right, targetSum);
             if(right){
                 return true;
             }
         }
         return false;
     }
 }

class Solution {
    Map<Integer, Integer> map;

    public TreeNode buildTree(int[] inorder, int[] postorder) {
        map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) {
            map.put(inorder[i], i);
        }

        return findNode(inorder, 0, inorder.length, postorder, 0, postorder.length);  // 前闭后开
    }

    public TreeNode findNode(int[] inorder, int inBegin, int inEnd, int[] postorder, int postBegin, int postEnd) {
        if (inBegin >= inEnd || postBegin >= postEnd) {
            return null;
        }
        int rootIndex = map.get(postorder[postEnd - 1]);
        TreeNode root = new TreeNode(inorder[rootIndex]);
        int lenOfLeft = rootIndex - inBegin;
        root.left = findNode(inorder, inBegin, rootIndex,
                postorder, postBegin, postBegin + lenOfLeft);
        root.right = findNode(inorder, rootIndex + 1, inEnd,
                postorder, postBegin + lenOfLeft, postEnd - 1);

        return root;
    }
}