[LeetCode] 830. Positions of Large Groups

题目描述

In a string S of lowercase letters, these letters form consecutive groups of the same character.

For example, a string like S = “abbxxxxzyy” has the groups “a”, “bb”, “xxxx”, “z” and “yy”.

Call a group large if it has 3 or more characters. We would like the starting and ending positions of every large group.

The final answer should be in lexicographic order.

Example 1:

Input: "abbxxxxzzy"
Output: [[3,6]]
Explanation: "xxxx" is the single large group with starting  3 and ending positions 6.

Example 2:

Input: "abc"
Output: []
Explanation: We have "a","b" and "c" but no large group.

Example 3:

Input: "abcdddeeeeaabbbcd"
Output: [[3,5],[6,9],[12,14]]

给定一个字符串，找到全部长度大于等于3并且全部字符相同子串的索引位置。

C++ 代码实现

思路就是使用两个游标分别代表子串的起始以及结束位置，遍历一遍字符串，插入满足条件的游标的位置

class Solution {
public:
    vector<vector<int>> largeGroupPositions(string S) {
        vector<vector<int>> res;
        int left = 0;
        int right = left + 2;
        while(left < S.size() && right < S.size())
        {
            if (  S[left] != S[left + 1]
               || S[left] != S[left + 2])
            {
                left++; 
            }
            else
            {
                while(right < S.size() && S[right] == S[left])
                {
                    right++;
                }
                res.emplace_back(vector<int>{left, right - 1});
                left = right;
            }
            right = left + 2;
        }
        return res;
    }
};