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

문제

내가 작성한 정답

Java

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;
    }
}

JavaScript

function solution(start_num, end_num) {
    var answer = [];
    for(let i =0; i<= end_num-start_num; i++){
        answer[i] = start_num + i;
    }
    return answer;
}

다른 사람들의 정답

Java

import java.util.stream.IntStream;

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

JavaScript

function solution(start, end) {
    return Array.from(Array(end - start + 1), (_, i) => start + i);
}


function solution(start, end) {
    return Array(end-start+1).fill(start).map((x,idx) => x+idx);
}