可以形成最大正方形的矩形数目

• 代码

代码

class Solution {
    public int countGoodRectangles(int[][] rectangles) {
        int res = 0;
        int maxLen = 0;
        for (int[] rectangle : rectangles) {
            int l = rectangle[0];
            int w = rectangle[1];
            int min = Math.min(l, w);
            if (min == maxLen) {
                ++res;
            } else if (maxLen < min) {
                maxLen = min;
                res = 1;
            }
        }
        return res;
    }
}

标签：easy,min,int,res,maxLen,正方形,leetcode1725,rectangles,rectangle
来源： https://blog.csdn.net/qq_43478625/article/details/122783293