위클리 챌린지 - 최소직사각형 (Java, Javascript)

Java

import java.util.Arrays;
class Solution {
    public int solution(int[][] sizes) {
        int width = 0;
        int height = 0;
        for(int[] size : sizes) {
            Arrays.sort(size);
            width = Math.max(width, size[0]);
            height = Math.max(height, size[1]);
        }
        return width*height;
    }
}

 

Javascript

function solution(sizes) {
    let width = 0;
    let height = 0;
    sizes.map(([w,h]) => w > h ? [w,h] : [h,w])
        .forEach(size => {
            width = Math.max(width, size[0]);
            height = Math.max(height, size[1]);
        });
    return width * height;
}