/*
思路:
从右边看,并不是指右节点--也就是每层最右边的节点,则考虑层次遍历只取最右
*/
public class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> list = new LinkedList<Integer>();
Queue<TreeNode> queue = new LinkedList<TreeNode>();
if(root == null) {
return list;
}
queue.add(root);
while(!queue.isEmpty()) {
int m = queue.size();
while(m > 0) {
TreeNode node = queue.remove();
if(node.left != null) {
queue.add(node.left);
}
if(node.right != null) {
queue.add(node.right);
}
m--;
if(m == 0) {
list.add(node.val);
}
}
}
return list;
}
}
leetcode-java-199. Binary Tree Right Side View
最新推荐文章于 2022-04-22 09:12:50 发布