로딩
요청 처리 중입니다...

JAVA_LeetCode 1725_Number Of Rectangles That Can Form The Largest Square

 JAVA_LeetCode 1725_Number Of Rectangles That Can Form The Largest Square

JAVA_LeetCode 1725_Number Of Rectangles That Can Form The Largest Square 풀이 class Solution { public int countGoodRectangles(int[][] rectangles) { int res = 0, max = 0, min = 0; for(int[] rectangle : rectangles) { min = Math.min(rectangle[0], rectangle[1]); if(min > max) { max = min; res = 1; } else if(min == max) res++; } return res; } } * 출처 https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/...

# JAVA # JAVA_LeetCode1725 # JAVA_LeetCode1725_NumberOfRectanglesThatCanFormTheLargestSquare # JAVA_NumberOfRectanglesThatCanFormTheLargestSquare # LeetCode1725_NumberOfRectanglesThatCanFormTheLargestSquare