[BAEKJOON] 15650 N과 M 2 (Java)

[ 소스 코드 ]

import java.util.Scanner;

public class Solution {
    static int N;
    static int M;
    static boolean visit[] = new boolean[9];

    static void permutation(int index, int cnt, int temp[]) {
        if (cnt == M) {
            for (int item : temp)
                System.out.print(item + " ");
            System.out.println();
            return;
        }
        for (int i = index+1; i <= N; i++) {
            if (!visit[i]) {
                visit[i] = true;
                temp[cnt] = i;
                permutation(i, cnt + 1, temp);
                visit[i] = false;
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        N = sc.nextInt();
        M = sc.nextInt();

        for (int i = 1; i <= N; i++) {
            int temp[] = new int[M];
            visit[i] = true;
            temp[0] = i;
            permutation(i, 1, temp);
            visit[i] = false;
        }
    }
}