[programmers] 광물 캐기

10 Apr 2023 in Algorithm on Algorithm

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

class Solution {
    int minFatigue = Integer.MAX_VALUE;

    public int solution(int[] picks, String[] minerals) {
        dfs(picks, minerals, 0, 0);
        return minFatigue;
    }

    private void dfs(int[] picks, String[] minerals, int index, int fatigue){
        if((picks[0] == 0 && picks[1] == 0 && picks[2] == 0) || index >= minerals.length){
            minFatigue = Math.min(minFatigue, fatigue);
            return;
        }

        for(int i = 0; i < 3 ; i++){
            if(picks[i] > 0){
                int[] newPicks = picks.clone();
                newPicks[i]--;

                dfs(newPicks, minerals, index+5, fatigue + calculateFatigue(i, minerals, index));
            }
        }
    }

    private int calculateFatigue(int pickType, String[] minerals, int start){
        int fatigue = 0;

        for(int i = start; i < start + 5 && i < minerals.length; i++){
            String mineral = minerals[i];

            if (pickType == 0) {
                fatigue += 1;
            } else if (pickType == 1) {
                if (mineral.equals("diamond")) fatigue += 5;
                else fatigue += 1;
            } else if (pickType == 2) {
                if (mineral.equals("diamond")) fatigue += 25;
                else if (mineral.equals("iron")) fatigue += 5;
                else fatigue += 1;
            }
        }

        return fatigue;
    }
}