코딩테스트 프로그래머스 - 단어 퍼즐

		a	p	p	l	e
app		1	1	1	99	99
ap		1	1	1	99	99
p		1	1	1	99	99
l		1	1	1	2	99
e		1	1	1	2	3
ple		1	1	2	2	2
pp		1	1	2	2	2

#include <iostream>
#include <string>
#include <vector>
using namespace std;

constexpr int MAX = 99999999;

int solution(vector<string> v, string s)
{
    vector<int> count(s.length(), MAX);

	for(int i = 0 ; i < s.length() ;i++)
	{
		int index = i;
		char c = s[i];
		for(int j = 0 ; j < v.size(); j++)
		{
			bool bIsSame = true;
			int length = v[j].length() - 1;
			if(v[j][length] == c)
			{
				for(int k = 0 ; k <= length; k++)
				{
					if(s[index - k] != v[j][length - k])
					{
						bIsSame = false;
						break;
					}
				}
				if(bIsSame == true)
				{
					if(index - length == 0)
					{
						count[index] = 1;
					}
					else
					{
						if(count[index - length - 1] + 1 < count[index])
						{
							count[index] = count[index - length - 1] + 1;
						}
					}
				}
			}
		}
	}

	int answer = count[s.length() - 1];
	if (answer >= MAX)
	{
		answer = -1;
	}

	return answer;
}