2020 KAKAO BLIND RECRUITMENT : 외벽 점검(리뷰 필요)

https://programmers.co.kr/learn/courses/30/lessons/60062

코딩테스트 연습 - 외벽 점검

// 코드

import java.util.*;
 
class Solution {
    
    static final int INF = Integer.MAX_VALUE;
    
    int MinCnt;
    int N;
    int[] Weak;
    int[] Dist;
    
    // 메서드 : 친구명수(x), 취약점 시작할 위치(idx), 각 취약점의 방문여부(visited) 
    void getResult(int x, int idx, int visited) {
        
        if(x > Dist.length) return;
        if(x >= MinCnt) return;
        
        for(int i=0; i<Weak.length; ++i) {
            int nextPos = (idx + i) % Weak.length;  
            int diff = Weak[nextPos] - Weak[idx];
            
            if(nextPos < idx) diff += N;
            
            if(diff > Dist[Dist.length - x]) break;
            
            visited |= 1 << nextPos; 
        } 
        if(visited == (1 << Weak.length) - 1) {
            MinCnt = x;
            return;
        }  
         
        for(int i=0; i<Weak.length; ++i) {
            if((visited & (1 << i)) != 0) continue;
            getResult(x + 1, i, visited);
        }
         
    } 
    
    public int solution(int n, int[] weak, int[] dist) {
        
        Arrays.sort(dist);
        N      = n;
        Weak   = weak;
        Dist   = dist;
        MinCnt = INF;
        
        for(int i=0; i<Weak.length; ++i) {
            getResult(1, i, 0);
        }
        
        if(MinCnt == INF) return -1;
         
        return MinCnt;
    }
}