[백준] 15664번 : N과 M (10)

부족한 부분, 틀린 부분에 대한 피드백은 언제든지 댓글로 남겨주세요:)

---

https://www.acmicpc.net/problem/15664

 

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedHashSet;
import java.util.StringTokenizer;

public class B15664 {
    static int N, M;
    static int[] num;
    static int[] arr;
    static LinkedHashSet<String> set = new LinkedHashSet<String>();
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        N = Integer.parseInt(st.nextToken());
        M = Integer.parseInt(st.nextToken());

        num = new int[N];
        arr = new int[M];

        st = new StringTokenizer(br.readLine());
        for(int i=0; i<N; i++) {
            num[i] = Integer.parseInt(st.nextToken());
        }

        Arrays.sort(num);

        dfs(0, 0);
        set.forEach(System.out::println);
    }

    private static void dfs(int start, int depth) {
        StringBuilder sb = new StringBuilder();
        if(depth == M) {
            for(int val : arr) {
                sb.append(val).append(" ");
            }
            set.add(sb.toString());
            return;
        }

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