문제

풀이

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

using namespace std;

int solution(string my_string, string is_suffix) {
    string temp = "";

    for (int i = 0; i < my_string.length(); i++)
    {
        for (int j = 0; j < i+1; ++j)
        {
            temp += my_string[j];
        }
        if (temp == is_suffix)
            return 1;
        temp = "";
    }
    return 0;
}