40重建二叉树41输出二叉树的右视图

40.重建二叉树

方法都知道，就是不太会用什么方法把代码写出来，把具体每次前序和中序的序列写出来，就可以知道递归的索引如何写

import java.util.*;
/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode reConstructBinaryTree(int [] pre,int [] vin) {
        if(pre.length==0||vin.length==0) return null;
        TreeNode root = new TreeNode(pre[0]);
        for(int i=0; i<vin.length; i++){
            if(pre[0]==vin[i]){
                root.left = reConstructBinaryTree(Arrays.copyOfRange(pre,1,i+1),Arrays.copyOfRange(vin,0,i));
                root.right = reConstructBinaryTree(Arrays.copyOfRange(pre,i+1,pre.length),Arrays.copyOfRange(vin,i+1,vin.length));
                break;
            }
        }
        return root;
        
    }
}

这里要注意集合类方法Arrays.copyOfRange是左闭右开的
时间复杂度和空间复杂度都是O(n)

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 {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        //59-11
        if(inorder.length==0||postorder.length==0) return null;
        TreeNode root = new TreeNode(postorder[postorder.length-1]);
        for(int i=0;i<inorder.length;i++){
            if(root.val==inorder[i]){
                root.left = buildTree(Arrays.copyOfRange(inorder,0,i),Arrays.copyOfRange(postorder,0,i));
                root.right = buildTree(Arrays.copyOfRange(inorder,i+1,inorder.length),Arrays.copyOfRange(postorder,i,inorder.length-1));
            }
        }
        return root;

    }
}

41输出二叉树的右视图

第一反应就是重建二叉树+层次遍历

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     * 求二叉树的右视图
     * @param xianxu int整型一维数组 先序遍历
     * @param zhongxu int整型一维数组 中序遍历
     * @return int整型一维数组
     */
    public int[] solve (int[] xianxu, int[] zhongxu) {
        // write code here
        TreeNode root = rebuild(xianxu, zhongxu);
        //层次遍历
        if(root==null) return null;
        Queue<TreeNode> q = new LinkedList<>();
        ArrayList<Integer> list = new ArrayList<>();
        q.offer(root);
        while(!q.isEmpty()){
            int count = q.size();
            for(int i=0;i<count;i++){
                TreeNode node = q.poll();
                if(node.left!=null) q.offer(node.left);
                if(node.right!=null) q.offer(node.right);
                if(i==count-1) list.add(node.val);
            }
        }
        int[] res = new int[list.size()];
        for(int i=0;i<list.size();i++){
            res[i] = list.get(i);
        }
        return res;
    }

    public TreeNode rebuild(int[] pre, int[] vin){
        if(pre.length==0||vin.length==0) return null;
        TreeNode root = new TreeNode(pre[0]);
        for(int i=0;i<vin.length;i++){
            if(vin[i]==pre[0]){
                root.left=rebuild(Arrays.copyOfRange(pre,1,i+1),Arrays.copyOfRange(vin,0,i));
                root.right=rebuild(Arrays.copyOfRange(pre,i+1,pre.length),Arrays.copyOfRange(vin,i+1,vin.length));
                break;

            }
        }
        return root;
    }
}