代码随想录算法训练营-day18-513. 找树左下角的值、112. 路径总和、113. 路径总和 II、106. 从中序与后序遍历序列构造二叉树、106. 从中序与后序遍历序列构造二叉树

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) {
        if(root == null) return 0;
        Queue<TreeNode> que = new LinkedList<>();
        int res = 0;
        que.offer(root);
        while (!que.isEmpty()) {
            int size = que.size();
            for (int i = 0; i < size; i++){
                TreeNode node = que.poll();
                if (i == 0) res = node.val;
                if (node.left != null) que.offer(node.left);
                if (node.right != null) que.offer(node.right);
            }
        }
        return res;
    }
}

112. 路径总和

代码：

/**
 * 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 boolean hasPathSum(TreeNode root, int targetSum) {
        if (root == null) return false;
        Stack<TreeNode> st1 = new Stack<>();
        Stack<Integer> st2 = new Stack<>();
        st1.push(root);
        st2.push(root.val);
        while (!st1.isEmpty()) {
            int size = st1.size();
            for(int i = 0; i < size; i++){
                TreeNode node = st1.pop();
                Integer sum = st2.pop();
                if(node.left == null && node.right == null && sum == targetSum) return true;
                if(node.left != null) {
                    st1.push(node.left);
                    st2.push(sum + node.left.val);
                }
                if(node.right != null) {
                    st1.push(node.right);
                    st2.push(sum + node.right.val);
                }
            }
        }
        return false;
    }
}

113. 路径总和 II

代码：

/**
 * 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<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<List<Integer>> res = new ArrayList<>();
        if(root == null) return res;

        List<Integer> path = new LinkedList<>();
        traversal(root, targetSum, path, res);
        return res;
    }
    public void traversal(TreeNode node, int count,List<Integer> path, List<List<Integer>> res) {
        path.add(node.val);
        if(node.left == null && node.right == null) {
            if(count - node.val == 0) { 
                res.add(new ArrayList(path));
            }
            return;
        }
        if(node.left != null){
            traversal(node.left, count - node.val, path, res);
            path.remove(path.size() - 1);
        }
        if(node.right != null){
            traversal(node.right, count - node.val, path, res);
            path.remove(path.size() - 1);
        }
    }
}

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

代码：

/**
 * 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 {
    Map<Integer, Integer> map;
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (inorder == null || postorder == null) return null;
        map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) {
            map.put(inorder[i], i);
        }
        return traversal(inorder, 0, inorder.length, postorder, 0, postorder.length);

    }
    public TreeNode traversal(int[] inorder, int inBegin, int inEnd, int[] postorder, int postBegin, int postEnd) {
        if (inEnd <= inBegin || postEnd <= postBegin) return null;

        int rootIndex = map.get(postorder[postEnd - 1]);
        int rootValue = inorder[rootIndex];
        TreeNode root = new TreeNode(rootValue);

        int lenOfLeft = rootIndex - inBegin;
        root.left = traversal(inorder, inBegin, rootIndex, postorder, postBegin, postBegin + lenOfLeft);
        root.right = traversal(inorder, rootIndex + 1, inEnd, postorder, postBegin + lenOfLeft, postEnd - 1); 
        //inorder数组与postorder数组长度都是相等的，所以lenOfLeft可以通用
        return root;
    }
}

105. 从前序与中序遍历序列构造二叉树

代码：

/**
 * 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 {
    Map<Integer, Integer> map;
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        map = new HashMap<>();
        if (preorder == null || inorder == null) return null;
        for (int i = 0; i < inorder.length; i++) {
            map.put(inorder[i], i);
        }
        return travaersal(preorder, 0, preorder.length, inorder, 0, inorder.length);

    }
    public TreeNode travaersal(int[] preorder, int preBegin, int preEnd, int[] inorder, int inBegin, int inEnd) {
        if (preBegin >= preEnd || inBegin >= inEnd) return null;

        int rootIndex = map.get(preorder[preBegin]);
        TreeNode root = new TreeNode(inorder[rootIndex]);
        int lenOfLeft = rootIndex - inBegin;
        root.left = travaersal(preorder, preBegin + 1, preBegin + 1 + lenOfLeft, inorder, inBegin, inBegin + lenOfLeft);
        root.right = travaersal(preorder, preBegin + 1 + lenOfLeft, preEnd, inorder, inBegin + lenOfLeft + 1, inEnd);
        return root;
    }
}