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

输入: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
输出: [3,9,20,null,null,15,7]

这道题能把递归函数f()编出来那么题目就迎刃而解了

所以定义递归函数TreeNode f(int[] preorder,int L1,int R1,int[] inorder,int L2,int R2)

代表：我给你前序的L1到R1，给你中序的L2到R2，你给我返回整棵树的根节点；

/**
 * 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[] preorder, int[] inorder) {
        return f(preorder,0,preorder.length-1,inorder,0,inorder.length-1);
    }
    TreeNode f(int[] preorder,int L1,int R1,int[] inorder,int L2,int R2){
        if(L1>R1)
        return null;
        if(L1==R1)
        return new TreeNode(preorder[L1]);

        TreeNode cur = new TreeNode(preorder[L1]);
        int index =L2;
        while(true){
            if(preorder[L1]==inorder[index]){
                break;
            }
            index++;
        }
        cur.left=f(preorder,L1+1,L1+index-L2,inorder,L2,index-1);
        cur.right=f(preorder,L1+index-L2+1,R1,inorder,index+1,R2);
        return cur; 
    }
}

这里的while(true),每次都需要去遍历数组，是可以用HashMap做一个预处理优化的

就有了下面的优化版本

/**
 * 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[] preorder, int[] inorder) {
        HashMap<Integer,Integer> map =new HashMap<>();
        for(int i=0;i<inorder.length;i++){
            map.put(inorder[i],i);
        }
        return f(preorder,0,preorder.length-1,inorder,0,inorder.length-1,map);
    }
    TreeNode f(int[] preorder,int L1,int R1,int[] inorder,int L2,int R2,HashMap<Integer,Integer> map){
        if(L1>R1)
        return null;
        if(L1==R1)
        return new TreeNode(preorder[L1]);

        TreeNode cur = new TreeNode(preorder[L1]);
        int index =L2;
        index =map.get(preorder[L1]);
        cur.left=f(preorder,L1+1,L1+index-L2,inorder,L2,index-1,map);
        cur.right=f(preorder,L1+index-L2+1,R1,inorder,index+1,R2,map);
        return cur; 
    }
}