JS Lv.0 배열 뒤집기

내가한 답

function solution(num_list) {
    var answer = [];
    var i = 0;
        
    if(num_list.length >=1 && num_list.length <= 1000){
        for(i=0; i < num_list.length; i++){
            if(num_list[i] >= 0 && num_list[i] <= 1000) 
            answer.push(num_list[num_list.length-1-i]);
            else answer = "제한사항확인필요";
        }
    }else answer = "제한사항확인필요";

    return answer;
}

 

 

🤶🏻 알고가기

unshift(i)

function solution(num_list) {
    var answer = [];
    num_list.forEach(i => answer.unshift(i))
    return answer
}

 

num_list.pop()

function solution(num_list) {
    var answer = [];
    while(num_list.length){
        answer.push(num_list.pop())
    }
    return answer;
}

function solution(num_list) {
    return num_list.sort((a, b) => -1);
}

function solution(num_list) {
    return num_list.reverse((a,b) => b-a);
}