[프로그래머스] 배열 조각하기

 

 

• 풀이

#include <string>
#include <vector>

using namespace std;

vector<int> solution(vector<int> arr, vector<int> query) {
    
    for(int i = 0; i < query.size(); ++i){
        if(i % 2 == 0) arr.erase(arr.begin() + query[i] + 1, arr.end());
        else arr.erase(arr.begin(), arr.begin() + query[i]);
    }
    return arr;
}