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

문제

내가 작성한 정답

for

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

StreamAPI

import java.util.stream.IntStream;

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