leetcode 515. Find Largest Value in Each Tree Row
import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public final class Pair<A,B> {
public final A first;
public final B second;
public Pair(A first, B second) {
this.first = first;
this.second = second;
}
}
public List<Integer> largestValues(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
if(root==null) return res;
Pair<TreeNode,Integer> rootpair = new Pair<TreeNode,Integer>(root, 0);
Queue<Pair<TreeNode,Integer>> queue = new LinkedList<Pair<TreeNode,Integer>>();
queue.offer(rootpair);
int pre = 0;
int max = Integer.MIN_VALUE;
while(!queue.isEmpty()){
Pair<TreeNode,Integer> elem = queue.poll();
TreeNode node = elem.first;
int layer = elem.second;
if(layer==pre){
if(node.val>max){
max = node.val;
}
}else{
res.add(max);
max = node.val;
pre = layer;
}
if(node.left!=null){
queue.offer(new Pair<TreeNode,Integer>(node.left, layer+1));
}
if(node.right!=null){
queue.offer(new Pair<TreeNode,Integer>(node.right, layer+1));
}
}
res.add(max);
return res;
}
}