LV. 0 :: 배열 뒤집기

https://school.programmers.co.kr/learn/courses/30/lessons/120821

프로그래머스

 

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

+)230509

const solution = (num_list) => { 
    return num_list.reverse();
}

230525 파이썬으로 다시 풀이

def solution(num_list): 
    return num_list[::-1]

230915 C++

#include <string>
#include <vector>
#include <algorithm> 

using namespace std;

vector<int> solution(vector<int> num_list) { 
std::reverse(num_list.begin(), num_list.end());
    return num_list;
}