프로그래머스 - 카펫

class Solution {
    public int[] solution(int brown, int yellow) {
        int[] answer = new int[2];
        int i=0;
        int row=0;
        
        while(true){
            i++;
            row = brown-(2*i);
            row/=2;           
            
            if(yellow == (row-2)*i){
                answer[0] = row;
                answer[1] = i+2;
                break;
            }
            
        }
        
        return answer;
    }
}