LeetCode Construct Binary Tree from Preorder and Inorder Traversal(构造二叉树)

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

Note:

You may assume that duplicates do not exist in the tree.

题意：给出二叉树的前序遍历和中序遍历，求二叉树。

前序遍历是先访问根结点，再访问左子树，右子树。中序遍历是先访问左子树，再访问根结点，接着是右子树

思路：根据前序遍历的第一个元素可以在中序遍历中确定左子树的包含元素和右子树的包含元素。然后可以根据左子树的前序遍历和中序遍历构造左子树，根据右子树的前序遍历和中序遍历构造右子树。

代码如下：

//二叉树的结构表示为
class TreeNode
{
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) {val = x;}
}
class Solution
{
    public TreeNode buildTree(int[] preorder, int[] inorder)
    {
        if (0 == preorder.length) return null;

        TreeNode root = new TreeNode(preorder[0]);
        int index = 0;
        for (int i = 0; i < inorder.length; i++)
        {
            if (inorder[i] == preorder[0])
            {
                index = i;
                break;
            }
        }

        int[] leftpreorder = new int[index];
        int[] leftinorder = new int[index];
        int[] rightpreorder = new int[preorder.length - index - 1];
        int[] rightinorder = new int[preorder.length - index - 1];

        for (int i = 0; i < index; i++)
        {
            leftpreorder[i] = preorder[1 + i];
            leftinorder[i] = inorder[i];
        }

        for (int i = 0; i < preorder.length - index - 1; i++)
        {
            rightpreorder[i] = preorder[index + 1 + i];
            rightinorder[i] = inorder[index + 1 + i];
        }

        root.left = buildTree(leftpreorder, leftinorder);
        root.right = buildTree(rightpreorder, rightinorder);

        return root;
    }
}