Level 0. 배열 조각하기

Level 0. 배열 조각하기

 

 

#include <iostream>
#include <vector>

using namespace std;

vector<int> solution(vector<int> arr, vector<int> query)
{
    size_t size = query.size();

    for (int i = 0; i < size; ++i)
        if (i & 1)
            arr.erase(arr.begin(), arr.begin() + query[i]);
        else
            arr.erase(arr.begin() + ++query[i], arr.end());

    return arr;
}