[백준 | 15630] N과 M(2) - Java

📃 제출

import java.util.Scanner;

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


        arr = new int[M];
        dfs(N, M, 0, 0);
    }

    public static void dfs(int N, int M, int index, int depth) {
        if (depth == M) {
            for (int i : arr) {
                System.out.print(i + " ");
            }
            System.out.println();
            return;
        }

        for (int i = index; i < N; i++) {
            arr[depth] = i + 1;
            dfs(N, M, i + 1, depth + 1);
        }
    }
}

✏ 풀이

ex ) N = 4 M = 2

---

---

---

---

---

---