[Programmers] 완전탐색- 카펫

zzenee·2022년 10월 6일
0

Algorithm&Coding-test

목록 보기
26/30
post-thumbnail

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

Problem

Code

import java.util.*;
class Solution {
    public int[] solution(int brown, int yellow) {
        int[] answer = new int[2];
        int s = brown + yellow;
        for (int i=3; i<=s-3; i++) {
            if (s%i == 0) {
                int brownCnt = 0;
                brownCnt = (i*2) + (s/i*2) - 4;
                if (brownCnt == brown) {
                    answer[0] = Math.max(i, s/i);
                    answer[1] = Math.min(i, s/i);
                    break;
                }
            }
        }
        
        return answer;
    }
}

Result

profile
꾸준히

0개의 댓글