class Solution {
public:
vector<vector<int>> largeGroupPositions(string S) {
vector<vector<int>>ans;
vector<int>tmp;
int count = 1;
int start = 0;
int end = 0;
for(int i =1;i<S.size();i++)
{
if(S[i] == S[i-1])
{
count++;
end = i;
}
else
{
if(count>=3)
{
tmp.clear();
tmp.push_back(start);
tmp.push_back(end);
ans.push_back(tmp);
}
count = 1;
start = i;
end = i;
}
}
if(count >=3)
{
tmp.clear();
tmp.push_back(start);
tmp.push_back(end);
ans.push_back(tmp);
}
return ans;
}
};
