[백준] 10974번 : 모든순열 - 자바(JAVA)

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

10974번: 모든 순열

 

문제 해석

단순하게 순열을 만드는 문제입니다.

 

코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main_10974_모든순열 {

	static int[] answers;
	static boolean[] visited;
	static int N;

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		N = Integer.parseInt(br.readLine());

		visited = new boolean[N];
		answers = new int[N];

		permutation(0);
		

	}

	private static void permutation(int cnt) {
		if (cnt == N) {
			StringBuilder sb = new StringBuilder();
			for(int e : answers) {
				sb.append(e + " ");
			}
			sb.append("\n");
			System.out.print(sb.toString());
			return;
		}

		for (int i = 0; i < N; i++) {
			if (visited[i]) {
				continue;
			}
			visited[i] = true;
			answers[cnt] = i + 1;
			permutation(cnt + 1);
			visited[i] = false;

		}

	}

}