LeetCode刷题记61-105. 从前序与中序遍历序列构造二叉树

LeetCode刷题记61

105. 从前序与中序遍历序列构造二叉树

题目

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode build(int[] preorder, int[] inorder, int pl, int pr, int il, int ir) {
        if (pl > pr || il > ir) {
            return null;
        } 
        if (pl == pr || il == ir) {
            return new TreeNode(preorder[pl]);
        }
        TreeNode root = new TreeNode(preorder[pl]);
        int i = il;
        while (i <= ir) {
            if (preorder[pl] == inorder[i]) {
                break;
            }
            i ++;
        }
        root.left = build(preorder, inorder, pl + 1, pl + i - il, il, i - 1);
        root.right = build(preorder, inorder, pl + i - il + 1, pr, i + 1, ir);
        return root;
    }
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        return build(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
    }
}

经典的建树
3/5
61/150