题目描述
方法思路
很简单的题目,我用了层序遍历的方法
class Solution {
//Runtime: 4 ms, faster than 92.82%
//Memory Usage: 40.1 MB, less than 46.20%
public List<Integer> largestValues(TreeNode root) {
List<Integer> ans = new LinkedList<>();
if(root == null) return ans;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
int temp = queue.peek().val;
int size = queue.size();
while(size-- > 0){
TreeNode node = queue.poll();
if(node.val > temp) temp = node.val;
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
ans.add(temp);
}
return ans;
}
}