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

题意：给定一个字符串，要求找出所有满足相同连续字符长度大于或等于3的子串，返回所有符合条件的子串的开始和结束下标；

解法：只需要在遍历数组时，对每一个元素，从下个元素开始找到他的最后一个位置，再判断其长度是否符合要求；

class Solution {
    public List<List<Integer>> largeGroupPositions(String S) {
        List<List<Integer>> result = new ArrayList<>();
        for(int i = 0; i < S.length(); i++) {
            int st = i;
            while(++i < S.length() && S.charAt(i) == S.charAt(st));
            --i;
            if (i - st >= 2) {
                List<Integer> list = new ArrayList<>();
                list.add(st);
                list.add(i);
                result.add(list);
            }
        }
        return result;
    }
}