[프로그래머스][JAVA] 카펫 (완전탐색)

근의 공식 ↓

class Solution {
    public int[] solution(int brown, int yellow) {
        
        // ax^2 + bx + c = 0의 근의 공식
        // int a = 1;
        int b = -(brown+4)/2;
        int c = brown + yellow;
        
        int hw1 = (-b +(int)(Math.sqrt(b*b-4*c)) )/2;
        int hw2 = (-b -(int)(Math.sqrt(b*b-4*c)) )/2;
        // System.out.println(h1);
        // System.out.println(h2);
        int h = Math.min(hw1,hw2);
        int w = Math.max(hw1,hw2);
        
        return new int[]{w,h};
    }
}

 

 

 

 

완전탐색 ↓

import java.util.*;
 
class Solution {
    public int[] solution(int brown, int yellow) {
        int total = brown+yellow;
        
        for(int i=3; i<=total; i++){
            if(total%i==0){
                int a = i;
                int b = total/i;
                if((a-2)*(b-2)==yellow){
                    return new int[]{Math.max(a,b), Math.min(a,b)};
                }
            }         
        }
        throw new IllegalArgumentException();
    }
}