Easy
Positions of Large Groups — Python
Full explanation · Time O(n) · Space O(1)
# Time: O(n)
# Space: O(1)
class Solution(object):
def largeGroupPositions(self, S):
"""
:type S: str
:rtype: List[List[int]]
"""
result = []
i = 0
for j in xrange(len(S)):
if j == len(S)-1 or S[j] != S[j+1]:
if j-i+1 >= 3:
result.append([i, j])
i = j+1
return result