항해3주차 자바스크립트 프로그래머스 - 배열 뒤집기

 

처음 풀이 

function solution(num_list) {
    var answer = Array.reverse(num_list);
    return answer;
}

수정한 풀이

function solution(num_list) {
    var answer = num_list.reverse();
    return answer;
}

다른 풀이

const solution = (num_list) => num_list.reverse()

function solution(num_list) {
    var answer = [];
    var j = num_list.length
    for(var i = 1; i <= j; i++){
        answer.push(num_list[j-i])
    }
    return answer;
}

function solution(num_list) {
    // return num_list.reverse();

    const answer = [...num_list];

    for (let i=0,len=Math.floor(answer.length/2); i<len; i++) {
        const rightIdx = answer.length - 1 - i;
        const left = answer[i];
        const right = answer[rightIdx];
        answer[i] = right;
        answer[rightIdx] = left;
    }

    return answer;
}

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

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

function solution(num_list) {
    var answer = [];
    for(let i = num_list.length - 1; i >= 0; i--) {
        answer.push(num_list[i]);
    }
    return answer;
}

function solution(num_list) {
    return [...num_list].reverse();
}

function solution(num_list) {
    var answer = [];
    let arr =[];
    num_list.map((e)=>{
        answer.unshift(e)
    })
    return answer;
}

function solution(num_list) {
    let temp = []
    let i = 0
    const listLen = num_list.length;

    while (i < listLen) {
        temp.push(num_list.pop());
        i++;
    }
    return temp;
}

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