[프로그래머스] 리스트 자르기

 

 

• 풀이

#include <string>
#include <vector>

using namespace std;

vector<int> solution(int n, vector<int> slicer, vector<int> num_list) {
    vector<int> answer;
    for(int i=0; i<num_list.size(); i++){
        if(n==1){
            answer.push_back(num_list[i]);
            if(i==slicer[1]) break;
        }
        else if(n==2 && i >= slicer[0]){
            answer.push_back(num_list[i]);
        }
        else if(n==3 && i >= slicer[0]){
            answer.push_back(num_list[i]);
            if(i==slicer[1]) break;
        }
        else if(n==4 && i >= slicer[0]){
            answer.push_back(num_list[i]);
            i+= slicer[2]-1;
            if(i>=slicer[1]) break;
        }
    }
    return answer;
}