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

 

Note: 1 <= S.length <= 1000

直接做，用类似于两个指针的思想，一个for循环，找到重复大于3的，记录下来，更新位置，不大于三的不管。

 

    vector<vector<int>> largeGroupPositions(string S) {
        vector<vector<int>> B;
        int length = S.length();
        int m = 0,n=0;
        int ll = 1;
        for(m = 0; m < length;)
        {
            n++;
            if(S[m] == S[n])
            {
                ll++;
                continue;
            }
            else{
                if(ll>=3)
                {
                    vector<int> C;
                    C.push_back(m);
                    C.push_back(n-1);
                    B.push_back(C);
                    m = n;
                    ll = 1;
                }
                else
                {
                    m = n;
                    ll = 1;
                }
            }
        }
        
        return B;
        
    }