Niuke-top101-bm340

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) {
    
        int n = pre.length;
        int m = vin.length;
        if(n == 0 || m == 0){
    
            return null;
        }
        TreeNode t = new TreeNode(pre[0]);
        for(int i = 0; i < vin.length; i++){
    
            if(pre[0] == vin[i]){
    
                t.left = reConstructBinaryTree(Arrays.copyOfRange(pre, 1, i+1), Arrays.copyOfRange(vin, 0, i));
                t.right = reConstructBinaryTree(Arrays.copyOfRange(pre, i+1, pre.length), Arrays.copyOfRange(vin, i+1, vin.length));
                break;
            }
        }
        return t;
    }
}