dfs 순열 알고리즘

dfs 순열 알고리즘

public static void permutation(int n,int r) {
    int[] answer = new int[r];
    int[] arr = new int[n];
    for(int i=1; i<=n;i++){
        arr[i-1] = i;
    }
    boolean[] visited = new boolean[n];
    perm(arr,answer,visited,0,n,r);
}

static void perm(int[] arr, int[] output, boolean[] visited, int depth, int n, int r) {
    if (depth == r) {
        System.out.println(Arrays.toString(output));
        return;
    }

    for (int i=0; i<n; i++) {
        if (!visited[i]) {
            visited[i] = true;
            output[depth] = arr[i];
            perm(arr, output, visited, depth + 1, n, r);
            visited[i] = false;
        }
    }
}

n개중에 r개 뽑아 중복없이 사전순으로 출력하는 순열 알고리즘

 

알고리즘

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

프로그래머스

https://github.com/yougeun6021/Algorithm/blob/master/src/Level2/Fatigability.java

GitHub - yougeun6021/Algorithm