#yyds干货盘点# LeetCode程序员面试金典：在每个树行中找最大值

class Solution {
    public List largestValues(TreeNode root) {
        if (root == null) {
            return new ArrayList();
        }
        List res = new ArrayList();
        dfs(res, root, 0);
        return res;
    }

    public void dfs(List res, TreeNode root, int curHeight) {
        if (curHeight == res.size()) {
            res.add(root.val);
        } else {
            res.set(curHeight, Math.max(res.get(curHeight), root.val));
        }
        if (root.left != null) {
            dfs(res, root.left, curHeight + 1);
        }
        if (root.right != null) {
            dfs(res, root.right, curHeight + 1);
        }
    服务器托管网}
}