백준 15663번 N과 M (9) [ Java ]

15663번: N과 M (9)

import java.io.*;
import java.util.*;

public class Main {
    static int n, r;
    static int[] num;
    static int[] arr;
    static boolean[] visited;
    static LinkedHashSet<String> set = new LinkedHashSet<>();
    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());
        r = Integer.parseInt(st.nextToken());
        visited = new boolean[n];
        num = new int[r];
        arr = Arrays.stream(br.readLine().split(" "))
                    .mapToInt(Integer::parseInt)
                    .sorted()
                    .toArray();
        bt(0);
        StringBuilder sb = new StringBuilder();
        set.stream().forEach(i->sb.append(i));
        System.out.print(sb);
    }
    static void bt(int depth){
        if (depth == r){
            String str = "";
            for (int i : num) str += i + " ";
            set.add(str+"\n");
            return;
        }
        for (int i=0; i<n; i++){
            if (!visited[i]){
                visited[i] = true;
                num[depth] = arr[i];
                bt(depth+1);
                visited[i] = false;
            }
        }
    }
}