Java重建二叉树

不想秃头Q-Q

于 2022-05-26 16:40:57 发布

阅读量264

点赞数

CC 4.0 BY-SA版权

分类专栏：剑指offer 文章标签： java leetcode 算法

本文链接：https://blog.csdn.net/LX__dream/article/details/124987503

剑指offer 专栏收录该内容

40 篇文章

订阅专栏

剑指offer 07.重建二叉树

class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        int n = preorder.length;
        if (n == 0) return null;
        int rootVal = preorder[0], rootIndex = 0;
        for (int i = 0; i < n; i++) {
            if (inorder[i] == rootVal) {
                rootIndex = i;
                break;
            }
        }
        TreeNode root = new TreeNode(rootVal);
        root.left = buildTree(Arrays.copyOfRange(preorder, 1, 1 + rootIndex), Arrays.copyOfRange(inorder, 0, rootIndex));
        root.right = buildTree(Arrays.copyOfRange(preorder, 1 + rootIndex, n), Arrays.copyOfRange(inorder, rootIndex + 1, n));

        return root;
    }
}

Arrays.copyOfRange()方法