OJ-0823**-CSDN博客

本文链接：https://blog.csdn.net/wsd_ontheroad/article/details/141463450

题目

在这里插入图片描述

            20(7-2+9+6)
            /      \
           -2       6
            \      /   

             0    0

左子树表示该节点左侧叶子节点为根节点Q的一颗新树；右子树表示该节点右侧叶子节点为根节点的一颗新树。

输入描述：
2行整数，第1行表示二叉树的中序遍历，第2行表示二叉树的前序遍历，以空格分割
例如：
7 -2 6 6 9
6 7 -2 9 6

输出描述：
1行整数，表示求和树的中序遍历，以空格分割
例如：
输出
-2 0 20 0 6

补充说明：
示例1

输入：
-3 12 6 8 9 -10 -7 
8 12 -3 6 -10 9 -7
输出：
0 3 0 7 0 2 0

分析

树中元素重复，计算前序根节点对应中序的索引：
要点1：根据前序遍历结果和中序遍历结果还原二叉树
前序遍历结果：[根节点，[左子树], [右子树]]
中序遍历结果：[[左子树], 根节点，[右子树]]
已知前序左右边界：preLeft, preRight
已知中序左右边界：inLeft, inRight
遍历中序结果存放Map记录索引：map.put(inOrder[i],i)
前序根节点左边界：preLeft --> 中序根节点值：root = preOrder[preLeft]
计算索引：遍历中序，满足root == inOrder[pIndex] && 前序左子树内容匹配中序左子树或者前序右子树内容匹配中序右子树，方式：排序子树数组之后进行内容比较，满足条件得到索引pIndex
得到根节点root：new Node(preOrder[preLeft])
得到中序左子树数左右边界：inLeft, pIndex - 1
得到中序右子树数左右边界：pIndex + 1, inRight
得到前序左子树数左右边界：preLeft + 1, pIndex - inLeft + preLeft
得到前序右子树数左右边界：pIndex - inLeft + preLeft + 1, preRight

树中元素不重复时，使用Map记录索引方式：
要点1：根据前序遍历结果和中序遍历结果还原二叉树
前序遍历结果：[根节点，[左子树], [右子树]]
中序遍历结果：[[左子树], 根节点，[右子树]]
已知前序左右边界：preLeft, preRight
已知中序左右边界：inLeft, inRight
遍历中序结果存放Map记录索引：map.put(inOrder[i],i)
前序根节点左边界：preLeft --> 中序根节点索引：pInex = map.get(preOrder[preLeft])
得到根节点root：new Node(preOrder[preLeft])
得到中序左子树数左右边界：inLeft, pIndex - 1
得到中序右子树数左右边界：pIndex + 1, inRight
得到前序左子树数左右边界：preLeft + 1, pIndex - preLeft + preLeft
得到前序右子树数左右边界：pIndex - preLeft + preLeft + 1, preRight

https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/solutions/255811/cong-qian-xu-yu-zhong-xu-bian-li-xu-lie-gou-zao-9/

要点2：原始二叉树根据左右子树点求和构建新树

题解1

import java.util.Arrays;
import java.util.Scanner;
import java.util.Stack;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String[] inStr = in.nextLine().split(" ");
        String[] preStr = in.nextLine().split(" ");
        int n = preStr.length;
        int[] inOrder = new int[n];
        int[] preOrder = new int[n];
        for (int i = 0; i < n; i++) {
            preOrder[i] = Integer.parseInt(preStr[i]);
            inOrder[i] = Integer.parseInt(inStr[i]);
        }

        Node root = buildTree(preOrder, inOrder, 0, n - 1, 0, n - 1);
        // 后序遍历赋值
        postOrder(root);
        System.out.println();
        // 中序遍历输出
        inOrder(root);
    }

    private static Node buildTree(
            int[] preOrder, int[] inOrder, int preLeft, int preRight, int inLeft, int inRight) {
        if (preLeft > preRight || inLeft > inRight) {
            return null;
        }
        int rootVal = preOrder[preLeft];
        Node root = new Node(rootVal);
        // 遍历inOrder找到满足根节点的索引
        int pIndex = getpIndex(preOrder, inOrder, preLeft, inLeft, inRight, rootVal);
        if (pIndex < 0) {
            return null;
        }
        // 左子树
        root.left = buildTree(preOrder, inOrder, preLeft + 1, pIndex - inLeft + preLeft, inLeft, pIndex - 1);
        // 右子树
        root.right = buildTree(preOrder, inOrder, pIndex - inLeft + preLeft + 1, preRight, pIndex + 1, inRight);

        return root;
    }

    private static int getpIndex(int[] preOrder, int[] inOrder, int preLeft, int inLeft, int inRight, int rootVal) {
        int pIndex = -1;
        for (int i = inLeft; i < inRight + 1; i++) {
            if (rootVal == inOrder[i]) {
                // 中序左子树
                int inLeftSize = i - inLeft;
                int[] inLeftChild = new int[inLeftSize];
                System.arraycopy(inOrder, inLeft, inLeftChild, 0, inLeftSize);
                Arrays.sort(inLeftChild);
                // 前序左子树
                int[] preLeftChild = new int[inLeftSize];
                System.arraycopy(preOrder, preLeft + 1, preLeftChild, 0, inLeftSize);
                Arrays.sort(preLeftChild);
                // 排序后的 前序左子树 完全匹配 中序左子树
                boolean flag = true;
                for (int j = 0; j < inLeftSize; j++) {
                    if (inLeftChild[j] != preLeftChild[j]) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    pIndex = i;
                    break;
                }
            }
        }
        return pIndex;
    }

    private static void postOrder(Node root) {
        Stack<Node> nodeStack = new Stack<>();
        Node cur = root;
        Node pre = null;
        while (!nodeStack.isEmpty() || cur != null) {
            while (cur != null) {
                nodeStack.push(cur);
                cur = cur.left;
            }
            Node top = nodeStack.peek();
            if (top.right == null || top.right == pre) {
                int res = 0;
                if (top.left != null) {
                    res += top.left.val + top.left.childSum;
                }
                if (top.right != null) {
                    res += top.right.val + top.right.childSum;
                }
                top.childSum = res;
                System.out.print(top.val + " ");
                pre = top;
                nodeStack.pop();
            } else {
                cur = top.right;
            }
        }
    }

    static class Node {
        private int val;
        private Node left;
        private Node right;
        public int childSum;

        Node(int val) {
            this.val = val;
        }
    }

    public static void inOrder(Node root) {
        if (root == null) {
            return;
        }
        inOrder(root.left);
        System.out.print(root.childSum + " ");
        inOrder(root.right);
    }
}

题解2

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {
    static Map<Integer, List<Integer>> map = new HashMap<>();

    public static void main(String[] args) {// 中序左子树
        Scanner in = new Scanner(System.in);
        String[] inStr = in.nextLine().split(" ");
        String[] preStr = in.nextLine().split(" ");
        int n = preStr.length;
        int[] inOrder = new int[n];
        int[] preOrder = new int[n];
        for (int i = 0; i < n; i++) {
            preOrder[i] = Integer.parseInt(preStr[i]);
            inOrder[i] = Integer.parseInt(inStr[i]);
            if (!map.containsKey(inOrder[i])) {
                map.put(inOrder[i], new ArrayList<>());
            }
            map.get(inOrder[i]).add(i);
        }

        Node root = buildTree(preOrder, inOrder, 0, n - 1, 0, n - 1);
        inOrder(root);
    }

    private static Node buildTree(int[] preOrder, int[] inOrder, int preLeft, int preRight, int inLeft, int inRight) {
        if (preLeft > preRight || inLeft > inRight) {
            return null;
        }
        int rootVal = preOrder[preLeft];
        Node root = new Node(rootVal);

        int pIndex = getpIndex(preOrder, inOrder, preLeft, inLeft, rootVal);
        if (pIndex < 0) {
            return null;
        }

        root.left = buildTree(preOrder, inOrder, preLeft + 1, pIndex - inLeft + preLeft, inLeft, pIndex - 1);
        root.right = buildTree(preOrder, inOrder, pIndex - inLeft + preLeft + 1, preRight, pIndex + 1, inRight);

        int leftChileSum = root.left == null ? 0 : root.left.val + root.left.childSum;
        int rightChileSum = root.right == null ? 0 : root.right.val + root.right.childSum;
        root.childSum = leftChileSum + rightChileSum;

        return root;
    }

    private static int getpIndex(int[] preOrder, int[] inOrder, int preLeft, int inLeft, int rootVal) {
        int pIndex = -1;
        List<Integer> list = map.get(rootVal);
        if (list.size() == 1) {
            return list.get(0);
        }
        for (Integer i : list) {
            if (i < inLeft) {
                continue;
            }
            int inLeftSize = i - inLeft;
            // 中序左子树
            int[] inLeftChild = new int[inLeftSize];
            System.arraycopy(inOrder, inLeft, inLeftChild, 0, inLeftSize);
            Arrays.sort(inLeftChild);
            // 前序左子树
            int[] preLeftChild = new int[inLeftSize];
            System.arraycopy(preOrder, preLeft + 1, preLeftChild, 0, inLeftSize);
            Arrays.sort(preLeftChild);
            // 排序后的 前序左子树 完全匹配 中序左子树
            boolean flag = true;
            for (int j = 0; j < inLeftSize; j++) {
                if (inLeftChild[j] != preLeftChild[j]) {
                    flag = false;
                    break;
                }
            }
            if (flag) {
                pIndex = i;
                list.remove(i);
                break;
            }
        }
        return pIndex;
    }

    static class Node {
        private int val;
        private Node left;
        private Node right;
        public int childSum;

        Node(int val) {
            this.val = val;
        }
    }

    public static void inOrder(Node root) {
        if (root == null) {
            return;
        }
        inOrder(root.left);
        System.out.print(root.childSum + " ");
        inOrder(root.right);
    }
}

参考

import java.util.*;
 
class TreeNode {
    int num;
    int childSum;
    TreeNode leftChild;
    TreeNode rightChild;
 
    public TreeNode(int num) {
        this.num = num;
        this.childSum = 0;
        this.leftChild = null;
        this.rightChild = null;
    }
}
 
public class Main {
    static int[] midOrder;
    static int[] preOrder;
    static int n;
    static Map<Integer, List<Integer>> midIndexMap;
 
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
 
        String[] midOrderInput = scanner.nextLine().split(" ");
        midOrder = new int[midOrderInput.length];
        for (int i = 0; i < midOrderInput.length; i++) {
            midOrder[i] = Integer.parseInt(midOrderInput[i]);
        }
 
        String[] preOrderInput = scanner.nextLine().split(" ");
        preOrder = new int[preOrderInput.length];
        for (int i = 0; i < preOrderInput.length; i++) {
            preOrder[i] = Integer.parseInt(preOrderInput[i]);
        }
 
        n = midOrder.length;
 
        midIndexMap = new HashMap<>();
        for (int j = 0; j < n; j++) {
            int num = midOrder[j];
            if (!midIndexMap.containsKey(num)) {
                midIndexMap.put(num, new ArrayList<>());
            }
            midIndexMap.get(num).add(j);
        }
 
        TreeNode root = buildTree(0, n - 1, 0, n - 1);
 
        List<Integer> res = new ArrayList<>();
        getMidOrder(root, res);
 
        StringBuilder result = new StringBuilder();
        for (int i = 0; i < res.size(); i++) {
            result.append(res.get(i));
            if (i != res.size() - 1) {
                result.append(" ");
            }
        }
 
        System.out.println(result.toString());
    }
 
    public static boolean notEquals(int midL, int preL, int size) {
        int[] arr1 = Arrays.copyOfRange(midOrder, midL, midL + size);
        int[] arr2 = Arrays.copyOfRange(preOrder, preL, preL + size);
 
        Arrays.sort(arr1);
        Arrays.sort(arr2);
 
        for (int i = 0; i < size; i++) {
            if (arr1[i] != arr2[i]) {
                return true;
            }
        }
 
        return false;
    }
 
    public static TreeNode buildTree(int midL, int midR, int preL, int preR) {
        if (preL > preR) {
            return null;
        }
 
        int rootNum = preOrder[preL];
        TreeNode root = new TreeNode(rootNum);
 
        for (int idx : midIndexMap.get(rootNum)) {
            if (idx < midL || idx > midR) {
                continue;
            }
 
            int leftLen = idx - midL;
            if (notEquals(midL, preL + 1, leftLen)) {
                continue;
            }
 
            int rightLen = midR - idx;
            if (notEquals(idx + 1, preR - rightLen + 1, rightLen)) {
                continue;
            }
 
            root.leftChild = buildTree(midL, idx - 1, preL + 1, preL + leftLen);
            root.rightChild = buildTree(idx + 1, midR, preR - rightLen + 1, preR);
 
            int leftChildSum = (root.leftChild == null) ? 0 : (root.leftChild.num + root.leftChild.childSum);
            int rightChildSum = (root.rightChild == null) ? 0 : (root.rightChild.num + root.rightChild.childSum);
 
            root.childSum = leftChildSum + rightChildSum;
 
            break;
        }
 
        return root;
    }
 
    public static void getMidOrder(TreeNode root, List<Integer> res) {
        if (root == null) {
            return;
        }
 
        TreeNode leftChild = root.leftChild;
        if (leftChild != null) {
            getMidOrder(leftChild, res);
        }
 
        res.add(root.childSum);
 
        TreeNode rightChild = root.rightChild;
        if (rightChild != null) {
            getMidOrder(rightChild, res);
        }
    }
}