[Programmers] (완전탐색) Lv 2. 카펫

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

프로그래머스

 

javascript

닫기 줄바꿈

function solution(brown, yellow) {
​​​​var answer = [];

​​​​const SUM = brown + yellow;
​​​​for (height = 3; height <= SUM / 2; ++height) {
​​​​​​​​let width = Math.floor(SUM / height);
​​​​​​​​if ((width - 2) * (height - 2) === yellow) return [width, height];
​​​​}

​​​​return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/42842.%E2%80%85%EC%B9%B4%ED%8E%AB

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드