leecode-106-从中序与后序遍历序列构造二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        return build(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1);
    }
    public TreeNode build(int[] inorder, int inStart, int inEnd, 
                          int[] postorder, int postStart, int postEnd) {
        // base case
        if (postStart > postEnd) {
            return null;
        }
        
        // root节点对应的值为前序遍历数组的第一个元素
        int rootVal = postorder[postEnd];
        
        // rootVal在中序遍历数组中的索引
        int index = 0;
        for (int i = inStart; i <= inEnd; i++) {
            if (inorder[i] == rootVal) {
                index = i;
                break;
            }
        }
        
		// 左子树的节点个数
        int leftSize = index - inStart;
        
        // 构造出当前根节点
        TreeNode root = new TreeNode(rootVal);
        
        // 递归构造左右子树
        root.left = build(inorder, inStart, index - 1, 
                           postorder, postStart, postStart + leftSize - 1);

        root.right = build(inorder, index + 1, inEnd,
                           postorder, postStart + leftSize, postEnd - 1);
        return root;
    }
}