programmers_단체사진 찍기_java

https://school.programmers.co.kr/learn/courses/30/lessons/1835

프로그래머스

import java.util.*;

class Solution {
    private static String[] friends = {"A", "C", "F", "J", "M", "N", "R", "T"};
    public int solution(int n, String[] data) {
        int answer = 0;

        answer = dfs("", new boolean[8], data);

        return answer;
    }

    private int dfs(String names, boolean[] isVisited, String[] datas) {
        if (names.length() == 7) {
            if (isSatisfaction(names, datas)) {
                return 1;
            }
            return 0;
        }
        
        int res = 0;
        for (int i = 0; i < 8; i++) {
            if (!isVisited[i]) {
                isVisited[i] = true;
                res += dfs( names + friends[i], isVisited, datas);
                isVisited[i] = false;
            }
        }
        return res;
    }

    // 만족 여부
    public boolean isSatisfaction(String names, String[] datas) {
        for (String data : datas) {
            int f1 = names.indexOf(data.charAt(0)); 
            int f2 = names.indexOf(data.charAt(2)); 
            char op = data.charAt(3);
            int dist = data.charAt(4) -'0'; 
            
            if (op == '=') {
                if (!(Math.abs(f1 - f2) == dist+1)) return false;
            } else if (op == '>') {
                if (!(Math.abs(f1 - f2) > dist+1)) return false;
            } else if (op == '<') {
                if (!(Math.abs(f1 - f2) < dist+1)) return false;
            }
        }
        return true;
    }
}