class Solution {
public:
vector<vector<int>> largeGroupPositions(string s)
{
vector<vector<int>>res;
int i=0,j=1;
while(j<s.length())
{
while(s[i]==s[j])
{
j++;
}
if(j-i>=3)
{
res.push_back({i,j-1});
}
i=j;
j++;
}
return res;
}
};
leetcode 830. 较大分组的位置
最新推荐文章于 2024-10-20 21:47:19 发布