[알고리즘문제풀기] 카운트 다운

문제

내가 작성한 정답

for

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

StreamAPI

import java.util.stream.*;

class Solution {
    public int[] solution(int start_num, int end_num) {
        return IntStream.rangeClosed(0, start_num-end_num)
                .map(i->start_num-i)
                .toArray();
    }
}

다른 사람들의 정답

import java.util.stream.IntStream;

class Solution {
    public int[] solution(int start, int end) {
        return IntStream.rangeClosed(-start, -end).map(i -> -i).toArray();
    }
}