LC-1446 Easy LeetCode

1446. Consecutive Characters

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 60% Topics: String

Reading material

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def maxPower(self, s):
        """
        :type s: str
        :rtype: int
        """
        result, count = 1, 1
        for i in xrange(1, len(s)):
            if s[i] == s[i-1]:
                count += 1
            else:
                count = 1
            result = max(result, count)
        return result


# Time:  O(n)
# Space: O(n)
import itertools


class Solution2(object):
    def maxPower(self, s):
        return max(len(list(v)) for _, v in itertools.groupby(s))

Solution from kamyu104/LeetCode-Solutions · MIT