199. 二叉树的右视图

void1024

已于 2024-06-29 00:57:45 修改

阅读量113

点赞数 1

分类专栏：面试经典 150 题文章标签： leetcode 算法数据结构 java

于 2024-06-27 23:42:29 首次发布

本文链接：https://blog.csdn.net/diOSyu/article/details/140027406

版权

面试经典 150 题专栏收录该内容

132 篇文章 1 订阅

订阅专栏

class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        if (root == null) {
            return result;
        }
        ArrayDeque<TreeNode> queue = new ArrayDeque<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            result.add(queue.getLast().val);
            int len = queue.size();
            for (int i = 0; i < len; i++) {
                TreeNode p = queue.pollFirst();
                if (p.left != null) {
                    queue.addLast(p.left);
                }
                if (p.right != null) {
                    queue.addLast(p.right);
                }
            }
        }
        return result;
    }
}

class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        travel(root, 1, result);
        return result;
    }

    public void travel(TreeNode root, int h, List<Integer> result) {
        if (root == null) {
            return;
        }
        if (h > result.size()) {
            result.add(root.val);
        } else {
            result.set(h - 1, root.val);
        }
        travel(root.left, h + 1, result);
        travel(root.right, h + 1, result);
    }
}

class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        if (root == null) {
            return result;
        }
        ArrayDeque<TreeNode> pQ = new ArrayDeque<>();
        ArrayDeque<Integer> dQ = new ArrayDeque<>();
        Map<Integer, Integer> rightMostValueAtDepth = new HashMap<>();
        pQ.addLast(root);
        dQ.addLast(0);
        int maxDepth = 0;
        while (!pQ.isEmpty()) {
            TreeNode p = pQ.removeLast();
            int depth = dQ.removeLast();
            maxDepth = Math.max(maxDepth, depth);
            rightMostValueAtDepth.put(depth, p.val);
            if (p.right != null) {
                pQ.addLast(p.right);
                dQ.addLast(depth + 1);
            }
            if (p.left != null) {
                pQ.addLast(p.left);
                dQ.addLast(depth + 1);
            }
        }
        for (int d = 0; d <= maxDepth; d++) {
            result.add(rightMostValueAtDepth.get(d));
        }
        return result;
    }
}