프로그래머스 Lv.0 카운트 다운 & 카운트 업

 

<Solution>

class Solution {
    public int[] solution(int start, int end_num) {
        int[] answer = new int [ start - end_num + 1];
        int idx = 0;
        while ( start >= end_num) {
            answer[idx++] = start;
            start--;
        }
        return answer;
    }
}

 

 

 

 

<Solution>

class Solution {
    public int[] solution(int start_num, int end_num) {
        int[] answer = new int [end_num - start_num + 1];
        int idx = 0;
        while (start_num <= end_num) {
            answer[idx++] = start_num;
            start_num++;
        }
        return answer;
    }
}