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

https://school.programmers.co.kr/learn/courses/30/lessons/86491?language=java

class Solution {
    public int solution(int[][] sizes) {
        int answer = 0;
        int[] sz = new int[2];
        
        sz[0] = Math.max(sizes[0][0],sizes[0][1]);
        sz[1] = Math.min(sizes[0][0], sizes[0][1]);
        
        for(int i=1; i<sizes.length; i++){
            
            if(sz[0] >= Math.max(sizes[i][0],sizes[i][1]) && 
               sz[1] >= Math.min(sizes[i][0],sizes[i][1])){
                continue;
            }else{
                
                sz[0] = Math.max(sz[0], Math.max(sizes[i][0],sizes[i][1]));
                sz[1] = Math.max(sz[1], Math.min(sizes[i][0],sizes[i][1]));
            }               
                        
        }
        
        
        answer = sz[0]*sz[1];
        
        return answer;
    }
}