LeetCode(106) Construct Binary Tree from Inorder and Postorder Traversal解题报告

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

解题思路:

后序加中序构造树，会先序加中序就会后序加中序，不会的话看上一个题。。。。。。

/**
 * 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(postorder.length == 0 || inorder.length == 0)
            return null;
        TreeNode root = new TreeNode(postorder[postorder.length-1]);
        if(postorder.length == 1 && inorder.length == 1)
            return root;
        for(int i = 0; i < inorder.length; i++){
            if(inorder[i] == postorder[postorder.length-1]){
                root.right = buildTree(assist(inorder,i+1,inorder.length-1),assist(postorder,i,postorder.length-2));
                root.left = buildTree(assist(inorder,0,i-1),assist(postorder,0,i-1));
            }
        }
        return root;
    }
    public int[] assist(int[] array,int start,int end){
        int[] res = new int[end-start+1];
        for(int i = start; i <= end; i++){
            res[i-start] = array[i];
        }
        return res;
    }
}