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

-Code

import java.util.Arrays;

class Solution {
    public int solution(int[][] sizes) {
        int max_w = 0, max_h = 0;
        for (int[] size : sizes) {
            Arrays.sort(size);
            max_w = Math.max(size[0], max_w);
            max_h = Math.max(size[1], max_h);
        }

        return max_w * max_h;
    }
}