[BOJ] 1316번 그룹 단어 체커

vector로 find해서 찾으려 했는데 뇌과부하 와서 배열로 풀었다.

#include <iostream>
using namespace std;
 
int main()
{
    int n;
    int cnt = 0;    
    char voca[101];
    //cout << "입력받을 횟수: ";
    cin >> n;
    for(int i=0;i<n;i++)
    {
        bool check[26]{false,};
        cin.ignore();
        cin.get(voca,100);    
        for(int j=0;voca[j]!='\0';j++)
        {
            //cout << "voca[j]: " << static_cast<int>(voca[j] - 97) << endl;
            //cout << "check[static_cast<int>(voca[j] - 97)]: " << check[static_cast<int>(voca[j] - 97)]  << endl;
            if(check[static_cast<int>(voca[j] - 97)] == false)
            {
                check[static_cast<int>(voca[j] - 97)] = true;
            //cout << "check[static_cast<int>(voca[j] - 97)]: " << check[static_cast<int>(voca[j] - 97)]  << endl;
            }
            else if(check[static_cast<int>(voca[j] - 97)] == true)
            {
                //cout << "voca[j-1]" << ' ' << voca[j-1] << ' ' << "voca[j]" << ' ' << voca[j] << endl;
                if(voca[j-1] == voca[j])
                {
                    //cout << "sequence voca\n";
                    
                }
                else
                {
                    //cout << "unsequnce voca\n";
                    break;
                }
            }
            if(voca[j+1] == '\0') cnt++;
        }
        //cout << endl;
    }
 
    //cout << "cnt: " << cnt << endl;
    cout << cnt << endl;
    return 0;
 
}