leetcode-830 Positions of Large Groups

Description:

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

题意:给定一个字符串s，返回其中连续(各个字符相同)的子串中长度大于3的起始位置

思路:利用两个指针start和len,在遍历过程中不断判断并更新其值。另外要注意诸如 "bbbbbbbbbb","aqwwwwwwwww"这样的情形

代码:

class Solution {
public:
	vector<vector<int>>largeGroupPositions(string S) {
		vector<vector<int>>res;
		//special status
		if (S.size() < 3)
			return res;
		int start = 0, len = 0;//分别为每个可能组合的首个字符(即参照),以及该子串的长度

		for (int i = 0;i < S.size();++i) {
			if (i != S.size()) {
				if (S[i] == S[start]) {
					len++;
					continue;
				}
				//隐含了遇到下一个子串的条件
				if (len >= 3) {
					res.push_back({ start,start+len-1 });
					//reset
					start = i;
					len = 1;
				}
				//和上述相类似
				else
				{
					len = 1;
					start = i;
				}
			}
			else
			{
				if (len >= 3)
					res.push_back({ start,start + len - 1 });
			}
		}

		return res;
	}
	
};

参考资料:

http://www.cnblogs.com/grandyang/p/4606334.html