牛客 剑指offer：输出二叉树的右视图

题目：输出二叉树的右视图

思路：

递归简历二叉树，然后借助队列广搜，找到每层最右的节点。

代码：

import java.util.*;

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