[프로그래머스] 기능개발

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

코딩테스트 연습 - 기능개발

---

[ 나의 풀이 ]

import java.util.*;

class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        List<Integer> answer = new ArrayList<>();
        int count = 0;
        int startIndex = 0;
        while (startIndex < progresses.length) {
            while (progresses[startIndex] < 100) {
                for(int i = startIndex; i < progresses.length; i++) {
                    progresses[i] = progresses[i] + speeds[i];
                }
            }
            count = countComp(startIndex, progresses);
            startIndex += count;
            answer.add(new Integer(count));
        }
        return answer.stream().mapToInt(Integer::intValue).toArray();
    }

    private static int countComp(int startIndex, int[] progresses) {
        int count = 0;
        for(int i = startIndex; i < progresses.length; i++) {
            if(progresses[i] < 100) {
                break;
            }else {
                count ++;
            }
        }

        return count;
    }
}

---

[ 카운트를 간단화 한 해설 ]

import java.util.*;

class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        int[] dayOfend = new int[100];
        int day = 0;
        for(int i = 0; i < progresses.length; i++) {
            while(progresses[i] + (day * speeds[i]) < 100) {
                day ++;
            }
            dayOfend[day]++;
        }
        
        return Arrays.stream(dayOfend).filter(i -> i!=0).toArray();
    }

}

---

[ 큐를 이용한 한 해설 ]

import java.util.*;

class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        Queue<Integer> q = new LinkedList<>();
        List<Integer> answerList = new ArrayList<>();
        
        for(int i = 0; i < speeds.length; i++) {
            double remain = (100 - progresses[i]) / (double) speeds[i];
            int date = (int) Math.ceil(remain);
            
            if(!q.isEmpty() && q.peek() < date) {
                answerList.add(q.size());
                q.clear();
            }
            
            q.offer(date);
        }
        
        answerList.add(q.size());
        
        return answerList.stream().mapToInt(Integer::intValue).toArray();
    }

}