[Programmers] (완전탐색) Lv 2. 소수 찾기

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

프로그래머스

 

const isPrime = (n) => {
    if (n <= 1) return false;
    for (let i = 2; i <= Math.sqrt(n); ++i)
        if (n % i === 0) return false;
    return true;
}

function solution(numbers) {
    var answer = 0;
    const arr = numbers.split('');
    const check = {}, visit = {};

    (function dfs(value) {
        if (!check[value] && isPrime(value)) ++answer;
        check[value] = true;

        for (let i = 0; i < arr.length; ++i) {
            if (visit[i]) continue;

            visit[i] = true;
            dfs((value.toString() + arr[i]) * 1, i);
            visit[i] = false;
        }
    })(0);

    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/42839.%E2%80%85%EC%86%8C%EC%88%98%E2%80%85%EC%B0%BE%EA%B8%B0

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