判断重复字符串

#include<iostream>
#include<string>
#include<set>
#include<algorithm>
#include<vector>
#include<unordered_map>
using namespace std;
class solution
{
public:
bool check(string s)
{
unordered_map<char,vector<int>> map_a;
for (int i = 0; i < s.size(); i++)
{
map_a[s[i]].push_back(i);
}
vector<int> locs_a = map_a[s[0]];
for (int i = 0; i < locs_a.size()-1; i++)
{
int flag = 1;
string holder=s.substr(locs_a[0], locs_a[i + 1]);
if (holder == s)
return false;
if (s.size() % holder.size() != 0)
{
continue;
}
else
{
for (size_t j = 0; j <= s.size(); j = j + holder.size())
{
if (holder != s.substr(j, j + holder.size()))
{
flag = 0;
   break;
}
}
if (flag==1)
return true;
}
}
}
};
int main()
{
string str;
cin >> str;
bool re;
solution s;
re=s.check(str);
if (re == true)
cout << "ok";
else
cout << "false";
return 0;
}