Java从中序后序遍历序列构造二叉树leetcode

给定两个整数数组 inorder 和 postorder ，其中 inorder 是二叉树的中序遍历， postorder 是同一棵树的后序遍历，请你构造并返回这颗 二叉树 。

1、从结构出发递归生成

/**
 * 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) {
        return buildTreeHelp(inorder,0,inorder.length-1,postorder,0,postorder.length-1);
    }
    public TreeNode buildTreeHelp(int[] inorder,int inleft,int inright,int[] postorder,int posleft,int posright){
        if(inleft > inright){
            return null;
        }

        int rootVal = postorder[posright];
        TreeNode root = new TreeNode(rootVal);

        int index = -1;
        for(int i = inleft;i <= inright;i++){
            if(inorder[i] == rootVal){
                index = i;
                break;
            }
        }
        int leftSize = index - inleft;

        root.left = buildTreeHelp(inorder,inleft,index - 1,postorder,posleft,posleft+leftSize-1);
        root.right = buildTreeHelp(inorder,index+1,inright,postorder,posleft+leftSize,posright-1);

        return root;
    }    

}

3ms，41.2MB

2、通过使用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[] inorder, int[] postorder) {
        //将所有inorder中的元素加入到哈希表中
        HashMap<Integer,Integer> map = new HashMap<>();
        for(int i = 0;i < inorder.length;i++){
            map.put(inorder[i],i);
        }

        return buildTreeHelp(inorder,0,inorder.length-1,postorder,0,postorder.length-1,map);
    }
    public TreeNode buildTreeHelp(int[] inorder,int inleft,int inright,int[] postorder,int posleft,int posright,HashMap<Integer,Integer> map){
        if(inleft > inright){
            return null;
        }

        int rootVal = postorder[posright];
        TreeNode root = new TreeNode(rootVal);

        int root_index = map.get(rootVal); 

        int leftSize = root_index - inleft;

        root.left = buildTreeHelp(inorder,inleft,root_index - 1,postorder,posleft,posleft+leftSize-1,map);
        root.right = buildTreeHelp(inorder,root_index+1,inright,postorder,posleft+leftSize,posright-1,map);

        return root;
    }    

}

1ms,41.3MB