[刷题]Construct Binary Tree from Inorder and Postorder Traversal

[LintCode]Construct Binary Tree from Inorder and Postorder Traversal

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
 
 
public class Solution {
    /**
     *@param inorder : A list of integers that inorder traversal of a tree
     *@param postorder : A list of integers that postorder traversal of a tree
     *@return : Root of a tree
     */
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        // 2015-07-23 
        // 个数 = 尾序号 - 首序号 + 1
        if (inorder == null || postorder == null || inorder.length == 0 || postorder.length == 0) {
            return null;
        }
        if (inorder.length != postorder.length) {
            return null;
        }
        
        return helper(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1);
    }
    
    private TreeNode helper(int[] inorder, int instart, int inend, int[] postorder, int poststart, int postend) {
        // exit
        if (instart > inend) {
            return null;
        }
        TreeNode root = new TreeNode(postorder[postend]);
        int pos = findPosition(inorder, postorder[postend]);
        // 个数pos - instart
        root.left = helper(inorder, instart, pos - 1, postorder, poststart, poststart + pos - instart - 1);
        // 个数inend - pos
        root.right = helper(inorder, pos + 1, inend, postorder, postend - inend + pos, postend - 1);
        return root;
    }
    
    private int findPosition(int[] arr, int target) {
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == target) {
                return i;
            }
        }
        return -1;
    }
}