[JAVA]112.路径总和 | 106.从中序与后序遍历序列构造二叉树 | 654.最大二叉树 | 617.合并二叉树

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

class Solution {
    Map<Integer, Integer> map;
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        map = new HashMap<>();
        //把中序的放入map
        for(int i = 0 ; i < inorder.length; i++){
            map.put(inorder[i], i); //是put，不是add
        }
        return findNode(inorder, 0 , inorder.length, postorder, 0 , postorder.length);
    }
    public TreeNode findNode(int[] inorder, int inorderstart, int inorderend, 
                        int[] postorder, int postorderstart, int postorderend){

        if(inorderstart >= inorderend || postorderstart >= postorderend) return null;
        //后续的最后一个数是中间数
        int middleIndex = map.get(postorder[postorderend - 1]);
        TreeNode root = new TreeNode(inorder[middleIndex]);
        //保存左子树个数
        int leftlen = middleIndex - inorderstart;
        root.left = findNode(inorder, inorderstart, middleIndex , 
                        postorder, postorderstart, postorderstart + leftlen );
        root.right = findNode(inorder, middleIndex + 1, inorderend , 
                        postorder, postorderstart + leftlen, postorderend -1 );
        return root;
        }
}

 *     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 TreeNode constructMaximumBinaryTree(int[] nums) {
        return findNode(nums, 0 , nums.length);
    }
    public TreeNode findNode(int[] nums, int start, int end){
        if(end - start < 1) return null;
        //只有一个左边的情况
        if(end - start == 1){
            return new TreeNode(nums[start]);
        } 
        int maxIndex = start;
        int maxVal = nums[start];
        for(int i = start + 1 ; i < end; i++){
            if (nums[i] > maxVal){
                maxVal = nums[i];
                maxIndex = i;
            }}
        TreeNode root = new TreeNode(maxVal);
        root.left = findNode(nums, start , maxIndex);
        root.right =  findNode(nums, maxIndex+1, end);
        return root;
    }
}

class Solution {
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if(root1 == null) return root2;
        if(root2 == null) return root1;
        root1.val += root2.val;
        root1.left = mergeTrees(root1.left, root2.left);
        root1.right =mergeTrees(root1.right, root2.right);
        return root1;
    }
}