问题:
You need to find the largest value in each row of a binary tree.
Example:
Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]
解决:
① 返回每一行的最大值。层序遍历。
class Solution { //11ms
public List<Integer> largestValues(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null) return res;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(! queue.isEmpty()){
int count = queue.size();
int max = Integer.MIN_VALUE;
for (int i = 0;i < count;i ++){
TreeNode cur = queue.poll();
max = Math.max(max,cur.val);
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
res.add(max);
}
return res;
}
}
② dfs
class Solution { //9ms
public List<Integer> largestValues(TreeNode root) {
List<Integer> res = new ArrayList<>();
dfs(root,0,res);
return res;
}
public void dfs(TreeNode root,int i,List<Integer> res){
if (root == null) return;
if (i == res.size()){
res.add(root.val);
}else if (res.get(i) < root.val){
res.set(i,root.val);
}
dfs(root.left,i + 1,res);
dfs(root.right,i + 1,res);
}
}