[BAEKJOON] 15665 N과 M 11 (Java)

[ 핵심소스 ]

static LinkedHashSet<String> h = new LinkedHashSet<String>();
if(h.add(input+"\n"))
    sb.append(input+"\n");
return;

[ 소스 코드 ]

import java.util.Arrays;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.Scanner;

public class _15665_N과M_11 {
    static final int MAX = 7;
	
    static int N, M;
    static int ary[];
    static int temp[];
	
    static StringBuilder sb = new StringBuilder();
    static LinkedHashSet<String> h = new LinkedHashSet<String>();
	
    static void permutation(int cnt) {
        if (cnt == M) {
            String input="";
            for(int item : temp)
                input+= item+" ";
            if(h.add(input+"\n"))
                sb.append(input+"\n");
            return;
        }
        for (int i = 0; i < N; i++) {
            temp[cnt] = ary[i];
            permutation(cnt + 1);
        }
    }

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

        ary=new int[N];
        temp=new int[M];
		
        for(int i=0;i<N;i++)
            ary[i] = sc.nextInt();
        Arrays.sort(ary);
		
        permutation(0);
        System.out.print(sb);
        sc.close();
    }
}