기지국 설치 (Summer/Winter Coding(~2018))

원본 : https://school.programmers.co.kr/learn/courses/30/lessons/12979

프로그래머스

 

풀이

class Solution {
    public int solution(int n, int[] stations, int w) {
        int answer = 0;
        int start = 1;

        for (int station : stations) {
            answer += fn(w, start, station - w);
            start = station + w + 1;
        }

        answer += fn(w, start, n + 1);

        return answer;
    }

    private int fn(int w, int start, int end) {
        if (start < end) {
            return (int)Math.ceil((end - start) / (double)(2 * w + 1));
        } else {
            return 0;
        }
    }
}