Leetcode-106. Construct Binary Tree from Inorder and Postorder Traversal

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        Map<Integer,Integer> num2position = new HashMap<Integer,Integer>();

        for(int i = 0 ; i < inorder.length;i++) num2position.put(inorder[i],i);

        return generateBT(inorder,postorder,0,inorder.length - 1, 0, postorder.length - 1,num2position);
    }

    private TreeNode generateBT(int[] inorder, int[] postorder,int inStart,int inEnd,int postStart,int postEnd,Map<Integer,Integer> num2position){

        if(inStart < 0 || inEnd >= inorder.length || postStart < 0 || postEnd >= postorder.length) return null;
        if(inStart > inEnd || postStart > postEnd) return null;

        TreeNode root = new TreeNode(postorder[postEnd]);
        int rootIndex = num2position.get(root.val);

        TreeNode leftNode = generateBT(inorder,postorder,inStart,rootIndex - 1, postStart,postEnd-(inEnd - rootIndex) - 1,num2position);
        TreeNode rightNode = generateBT(inorder,postorder,rootIndex + 1, inEnd,postEnd - (inEnd - rootIndex),postEnd - 1,num2position);

        root.left = leftNode;
        root.right = rightNode;

        return root;
    }
}