【LeetCode】199. Binary Tree Right Side View 二叉树的右视图(Medium)(JAVA)
题目地址: https://leetcode.com/problems/binary-tree-right-side-view/
题目描述:
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Example:
Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:
1 <---
/ \
2 3 <---
\ \
5 4 <---
题目大意
给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
解题方法
- 采用先序遍历,然后记录下当前 root 的高度
- 如果 List 中已经有当前元素,替换即可
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> list = new ArrayList<>();
rH(list, root, 0);
return list;
}
public void rH(List<Integer> list, TreeNode root, int level) {
if (root == null) return;
if (list.size() <= level) {
list.add(root.val);
} else {
list.set(level, root.val);
}
rH(list, root.left, level + 1);
rH(list, root.right, level + 1);
}
}
执行耗时:1 ms,击败了96.13% 的Java用户
内存消耗:36.9 MB,击败了93.40% 的Java用户
![](https://img-blog.csdnimg.cn/20201107174624800.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzE2OTI3ODUz,size_16,color_FFFFFF,t_70#pic_center)