[프로그래머스] 최소직사각형

 

 

 

[문제]

https://school.programmers.co.kr/learn/courses/30/lessons/86491#qna

프로그래머스

 

 

 

[소스 코드]

class Solution {
    public int solution(int[][] sizes) {
        int answer = 0;
        int row = 0;
        int col = 0;
        
        for(int i=0;i<sizes.length;i++){
            int w = Math.min(sizes[i][0],sizes[i][1]);
            int h = Math.max(sizes[i][0],sizes[i][1]);
            row = Math.max(w,row);
            col = Math.max(h,col);
        }
        answer = row * col;
        return answer;
    }
}