Construct Binary Tree from Inorder and Postorder Traversal ---LeetCode

https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

解题思路：
http://www.cnblogs.com/grandyang/p/4296193.html

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (inorder == null || postorder == null) return null;

        HashMap<Integer, Integer> map = new HashMap<>();
        for(int i=0; i<inorder.length; i++)
            map.put(inorder[i], i);
        return helper(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1, map);
    }
    public TreeNode helper(int[] inorder, int inL, int inR, int[] postorder, int postL, int postR, HashMap<Integer, Integer> map) {
        if (inL > inR || postL > postR) return null;

        TreeNode root = new TreeNode(postorder[postR]);
        int index = map.get(root.val);

        root.left  = helper(inorder, inL, index - 1, postorder, postL, postL + (index - inL) - 1, map);
        root.right = helper(inorder, index + 1, inR, postorder, postR - (inR - index), postR - 1, map);

        return root;
    }
}