BOJ - 6603 ) 로또 JAVA

---

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

6603번: 로또

---

숫자를 배열에 담아 

 

6개의 숫자를 DFS로 탐색하면서 방문처리를 통하여 경우의 수를 구한다.

 

---

 

 
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Scanner;
 
public class Main {
    static int num[];
    static int size =6;
    static boolean visit[];
    static ArrayList<Integer> al = new ArrayList<>();
    public static void DFS(int start_index) {
        
        if(al.size() == size) {
            
            for(int index = 0 ; index < size; index++) {
                System.out.print(al.get(index)+ " ");
            }
            System.out.println();
            return;
        }
        for(; start_index <num.length;start_index++) {
            if(!visit[start_index]) {
                visit[start_index] = true;
                al.add(num[start_index]);
                DFS(start_index+1);
                visit[start_index] = false;
                al.remove(al.size()-1);
            }
        }
        
        
        
    }
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int len = sc.nextInt();
        while(len !=0 && len >0) {
            num = new int[len];
            visit = new boolean[len];
            for(int index  = 0 ; index < len ; index++) {
                num[index] = sc.nextInt();
            }
            DFS(0);
            System.out.println();
            len = sc.nextInt();
        }
        
        
        
        
    }
 
}
 

---