[Programmers] 카펫 - 완전탐색

// 카펫 - 완전탐색
public class Carpet {
	public int[] solution(int brown, int red) {
		int[] answer = new int[2];

		for (int i = 1; i <= Math.sqrt(red); i++) { // Math.sqrt 까지 - 효율성
			if (red % i == 0 && red + brown == (i + 2) * (red / i + 2)) { // Short-Circuit Evaluation
				answer[0] = red / i + 2;
				answer[1] = i + 2;
			}
		}
		return answer;
	}

	public static void main(String[] args) {

		Carpet s = new Carpet();
		s.solution(10, 2); // [4,3]
		s.solution(8, 1); // [3,3]
		s.solution(24, 24); // [8,6]

	}
}