문제

풀이

#include <string>
#include <vector>

using namespace std;

vector<int> solution(int n, vector<int> slicer, vector<int> num_list) {
    vector<int> answer;
    
    int a = slicer[0];
    int b = slicer[1];
    int c = slicer[2];
    
    if (1 == n)
    { 
        for (int i = 0; i <= b; ++i)
        {
            answer.push_back(num_list[i]);
        }
    }
    else if(2 == n)
    { 
        for (int i = a; i < num_list.size(); ++i)
        {
            answer.push_back(num_list[i]);
        }
    }

    else if(3 == n)
    {
        for (int i = a; i <= b; ++i)
        {
            answer.push_back(num_list[i]);
        }
    }
   
    else
    {
        for (int i = a; i <= b; i+=c)
        {
            answer.push_back(num_list[i]);
        }
    }

    return answer;
}