输出二叉树的右视图

最新推荐文章于 2024-06-20 16:05:25 发布

HCH996

最新推荐文章于 2024-06-20 16:05:25 发布

阅读量206

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/weixin_37841366/article/details/111410649

版权

算法专栏收录该内容

99 篇文章 0 订阅

订阅专栏

牛客地址

实现代码

import java.util.*;
class TreeNode{
    int val;
    public TreeNode(int val){
        this.val = val;
    }
    TreeNode left;
    TreeNode right;
}

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     * 求二叉树的右视图
     * @param xianxu int整型一维数组 先序遍历
     * @param zhongxu int整型一维数组 中序遍历
     * @return int整型一维数组
     */
    public int[] solve (int[] xianxu, int[] zhongxu) {
        if(xianxu == null || xianxu.length == 0){
            return null;
        }
        // write code here
        ArrayList<Integer> list = new ArrayList<>();
        TreeNode root =  solveCore(xianxu, 0, zhongxu, 0, xianxu.length);
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            int size = queue.size();
            for(int i = 0; i <= size - 1; i++){
                TreeNode node = queue.poll();
                if(null != node.left){
                    queue.offer(node.left);
                }
                if(null != node.right){
                    queue.offer(node.right);
                }
                if(i == size - 1){
                    list.add(node.val);
                }
            }
        }
        int size = list.size();
        int[] res = new int[size];
        for(int i = 0; i < size; i++){
            res[i] = list.get(i);
        }
        return res;
    }
    public TreeNode solveCore(int[] preOrder, int preStart, int[] inOrder, int inStart, int len){
        if(len <= 0){
            return null;
        }
        /*if(len == 1){
            return new TreeNode(preOrder[preStart]);
        }*/
        int rootValue = preOrder[preStart];
        TreeNode root = new TreeNode(rootValue);
        int index = inStart;
        while(index < (inStart + len) && inOrder[index] != rootValue){
            index ++;
        }
       // while(index < (inStart + len) && inOrder[index++] != rootValue);
        int leftTreeSize = index - inStart;
        int rightTreeSize = len - 1 - leftTreeSize;
        
        TreeNode left = solveCore(preOrder, preStart + 1, inOrder, inStart, leftTreeSize);
        TreeNode right = solveCore(preOrder, preStart + leftTreeSize + 1, inOrder, index + 1, rightTreeSize);
        root.left = left;
        root.right = right;
        return root;
    }
}