[알고리즘] 백준 10974. 모든 순열

 

 

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

10974번: 모든 순열

 

 

import java.util.Arrays;
import java.util.Scanner;

public  class Main {

	
	static int[] answer;
	
	static int n;
	
    public static void main (String[] args) {    
    	
    	Scanner sc = new Scanner(System.in);
    	
    	n = sc.nextInt();
    	
    	answer = new int[n];
    	
    	permutation(0,new boolean[n]);
    	
    }
    
    static void permutation(int start, boolean[] bool) {
    	if(start == n) {
    		
    		for(int i=0; i<answer.length; i++) {
    			System.out.print(answer[i] + " ");
    		}
    		System.out.println();
    		return;
    	}
    	
    	for(int i=0; i<n; i++) {
    		if(bool[i])
    			continue;
    		
    		bool[i] = true;
    		answer[start] = i+1;
    		permutation(start+1, bool);
    		bool[i] = false;
    	}

    }
    
    

}