噢 bfs leetcode 515. Find Largest Value in Each Tree Row

最新推荐文章于 2022-06-24 09:01:55 发布

原创最新推荐文章于 2022-06-24 09:01:55 发布 · 398 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

算法专栏收录该内容

157 篇文章

订阅专栏

本文提供了一个解决LeetCode 515题“在每一层中寻找最大值”的算法实现。通过定义一个特殊的Pair类来跟踪节点及其所在的层数，并使用队列进行层级遍历，最终获取每层的最大值。

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;
    }
}