leetcode Construct Binary Tree from Inorder and Postorder Traversal

题目链接

/**
 * 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||inorder.length==0)
        {
            return null;
        }


        TreeNode root=new TreeNode(postorder[postorder.length-1]);
        build(root, inorder, 0, inorder.length-1, postorder, 0, postorder.length-1);
        return root;
    }

    public void build(TreeNode root,int[] inorder, int ins,int ine,int[] postorder,int pos,int poe)
    {
        int parentIndexInMiddle=ins;

        while(inorder[parentIndexInMiddle]!=root.val)
        {
            parentIndexInMiddle++;
        }

        int leftCount=parentIndexInMiddle-ins;



        if(leftCount>0)
        {
            int leftRootIndexInPost=pos+leftCount-1;
            root.left=new TreeNode(postorder[leftRootIndexInPost]);
            build(root.left, inorder, ins, parentIndexInMiddle-1, postorder, pos, leftRootIndexInPost);
        }

        int rightCount=ine-parentIndexInMiddle;
        if(rightCount>0)
        {
            int rightRootIndexInpost=poe-1;
            root.right=new TreeNode(postorder[rightRootIndexInpost]);
            build(root.right, inorder, parentIndexInMiddle+1, ine, postorder, poe-rightCount, poe-1);
        }
    }
}