[Day11] 830. Positions of Large Groups

830. Positions of Large Groups

class Solution {
    public List<List<Integer>> largeGroupPositions(String S) {
        S = S+"\0";
        List<List<Integer>> positions = new ArrayList<List<Integer>>();

        int largest=1;
        
        if (S.length()==0) return positions;        
        
        for (int i=0; i<S.length()-1; i++) {
            if (S.charAt(i) != S.charAt(i+1)) {
                if (largest >= 3) {                
                    List<Integer> largeGroup = new ArrayList();
                    largeGroup.add(i-(largest-1));
                    largeGroup.add(i);
                    positions.add(largeGroup);
                } 
                largest=1;
            } else { largest++; }
        }
    
        return positions;
    }
}

Accepted

6 ms

39.9 MB

java

Runtime: 6 ms, faster than 100.00% of Java online submissions for Positions of Large Groups.

Memory Usage: 39.9 MB, less than 38.61% of Java online submissions forPositions of Large Groups.