카펫 (완전탐색)

원본 : https://school.programmers.co.kr/learn/courses/30/lessons/42842

프로그래머스

 

풀이

import java.util.*;

class Solution {
    public int[] solution(int brown, int yellow) {
        Long[] answer = new Long[2];
        long square = brown + yellow;

        for (long i = 1; i <= square; i++) {
            if (square % i == 0 && brown == i * (square / i) - (i - 2) * ((square / i) - 2)) {
                answer[0] = i;
                answer[1] = square / i;
                break;
            }
        }

        Arrays.sort(answer, Comparator.reverseOrder());

        return new int[]{answer[0].intValue(), answer[1].intValue()};
    }
}