830. Positions of Large Groups

830. Positions of Large Groups

---

题目

Leetcode题目

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]]

Note: 1 <= S.length <= 1000

---

解决

遍历字符串，当某一字符的出现次数超过三次，就将该字符的开始和结束下标记录下来。
假设字符串长度为n。

• 时间复杂度：
• 空间复杂度：

1.暴力遍历解决

class Solution {
public:
    vector<vector<int>> largeGroupPositions(string S) {
        vector<vector<int> > result;
        int len = S.length();
        int start = 0;
        char front = S[0];
        int times = 1;
        for (int i = 1; i < len; i++) {
            if (S[i] == front) {
                times++;
            } else {
                if (times >= 3) {
                    result.push_back({start, i - 1});
                }
                times = 1;
                front = S[i];
                start = i;
            }
            if (i == len - 1 && times >= 3) {
                result.push_back({start, i});
            }
        }
        return result;
    }
};

2.遍历优化

class Solution {
public:
    vector<vector<int>> largeGroupPositions(string S) {
        vector<vector<int> > result;
        int len = S.length();
        int times = 0;
        int start = 0;
        int end = 0;
        while (start < len) {
            while (S[start] == S[end]) {
                end++;
                times++;
            }
            if (times >= 3) result.push_back({start, end - 1});
            start = end;
            times = 0;
        }
        return result;
    }
};