Leetcode105/106

给出一颗树的前序和中序，求原树的形状。

递归解法：

根据前序遍历，找到root， 根据root在中序的位置，位置左边是root的左子树，root的右边数root的右子树。

 

public class Leetcode0105 {

    public TreeNode buildTree(int[] preorder, int[] inorder) {
        int len = preorder.length;
        return help(0, len - 1, preorder, 0, len - 1, inorder);

    }
    //实际上可以不传e1这个参数
    private TreeNode help(int s1, int e1, int[] preorder, int s2, int e2, int[] inorder) {
        //important
        if (s1 > e1) return null;
        if (s2 > e2) return null;
        if (s1 > preorder.length - 1) return null;
        TreeNode root = new TreeNode(preorder[s1]);
        int mid = -1;
        for (int i = s2; i <= e2; i++) {
            if (inorder[i] == root.val) {
                mid = i;
                break;
            }
        }
        root.left = help(s1 + 1, e1, preorder, s2, mid - 1, inorder);
        root.right = help(s1 + 1 + mid - s2, e1, preorder, mid + 1, e2, inorder);
        return root;
    }
    
}

 

    public TreeNode buildTree(int[] inorder, int[] postorder) {
        int len = inorder.length;
        return help(0, len - 1, inorder, 0, len - 1, postorder);
    }

    private TreeNode help(int s1, int e1, int[] inorder, int s2, int e2, int[] postorder) {
        if (s1 > e1) return null;
        if (s2 > e2) return null;
        if (s1 > inorder.length - 1 || s2 > postorder.length - 1) return null;
        if (e1 < 0 || e2 < 0) return null;
        TreeNode root = new TreeNode(postorder[e2]);
        int mid = -1;

        for (int i = s1; i <= e1; i++) {
            if (inorder[i] == root.val) {
                mid = i;
                break;
            }
        }

        int leftNum = mid - s1;

        root.left = help(s1, mid - 1, inorder, s2, s2 + leftNum - 1, postorder);
        root.right = help(mid + 1, e1, inorder, s2 + leftNum, e2 - 1, postorder);
        return root;
    }

 

迭代的不会。。