LeetCode106.从中序与后序构造树————java

题目描述：

给定两个整数数组 inorder 和 postorder ，其中 inorder 是二叉树的中序遍历， postorder
是同一棵树的后序遍历，请你构造并返回这颗 二叉树 。

示例 1:

输入：inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
输出：[3,9,20,null,null,15,7] 示例 2:

输入：inorder = [-1], postorder = [-1] 输出：[-1]

深度优先搜索————递归法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
       return getTree(inorder,0,inorder.length,postorder,0,postorder.length);
        }

    public TreeNode getTree(int[] inorder,int inLeft,int inRight,int[] postorder,int postLeft, int postRight)
    {

        if(inRight-inLeft<1)
        {
            return null;
        }
        if(inRight-inLeft==1)
        {
            return new TreeNode(inorder[inLeft]);
        }

        int resultVal=postorder[postRight-1];
        TreeNode root=new TreeNode(resultVal);
        int Index=0;
        for(int i=inLeft;i<inRight;i++)
        {
            if(resultVal==inorder[i])
            {
                Index=i;
                break;
            }
        }

        root.left=getTree(inorder,inLeft,Index,postorder,postLeft,postLeft+(Index-inLeft));
        root.right=getTree(inorder,Index+1,inRight,postorder,postLeft+(Index-inLeft),postRight-1);
        return root;


    }


}