[백준] 1759번 암호 만들기

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

1759번: 암호 만들기

 

자음, 모음 수 판별하는 조건 추가

depth가 출력 index 넘지 않도록 조건 추가

 

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

public class Main {

public static int L, C;
public static String[] arr;
public static boolean[] visit;
public static String[] ans;
public static StringBuilder sb = new StringBuilder();

public static void main(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer(br.readLine());
    L = Integer.parseInt(st.nextToken());
    C = Integer.parseInt(st.nextToken());
    arr = new String[C];
    visit = new boolean[C];
    ans = new String[L];
    st = new StringTokenizer(br.readLine());
    for(int i = 0; i < C; i++) {
    	arr[i] = st.nextToken();
    }

    Arrays.sort(arr);
    dfs(0, 0);
    System.out.println(sb);

    }

    public static void dfs(int start, int depth) {
        if(depth == L && isValid()) {
            for(int j = 0; j < ans.length; j++) {
                sb.append(ans[j]);
            }
        sb.append("\n");
        return;
        }

        for(int i = start; i < C; i++) {
            if(!visit[i] && depth < ans.length) {
                visit[i] = true;
                ans[depth] = arr[i];
                dfs(i + 1, depth + 1);
                visit[i] = false;

            }
        }

    }

    public static boolean isValid() {
        boolean flag = false;
        int mo = 0;
        int ja = 0;
        for(int i = 0 ; i < ans.length; i++) {

            if("a".equals(ans[i]) || "e".equals(ans[i]) || "i".equals(ans[i]) || "o".equals(ans[i]) || "u".equals(ans[i]) ) {
                mo++;
            } else {
                ja++;
            }
        }
        if(mo >= 1 && ja >= 2) {
        	flag = true;
        }
        return flag;

    }
}