LeetCode: Max Consecutive Ones

class Solution(object):
    ## https://code.dennyzhang.com/max-consecutive-ones
    ## Basic Ideas:  counter
    ##               If found one 0, reset the counter to 0. Otherwise counter + 1
    ##
    ## Complexity: Time O(n), Space O(1)
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        max_count, counter = 0, 0
        for num in nums:
            if num == 1:
                counter = counter+1
                max_count = max(max_count, counter)
            else:
                counter = 0
        return max_count

    ## Ideas: Two pointers
    ##              i points to the start of consecutive of 1s
    ##              j points to the next element of the end of consecutive of 1s.
    ##
    ##  Assumption: [1, 0, 1], we should return 1
    ## Complexity: Time O(n), Space O(1)
    def findMaxConsecutiveOnes_v1(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        max_count = 0
        length  = len(nums)
        i = 0
        while i < length:
            if nums[i] == 0:
                i += 1
                continue
            # nums[i] == 1
            j = i + 1
            while j < length and nums[j] == 1:
                j += 1
            # nums[j] == 0 and nums[j-1] == 1
            max_count = max(max_count, j-i)
            # move to next
            i = j + 1
        return max_count

# s = Solution()
# print s.findMaxConsecutiveOnes([0]) # 0
# print s.findMaxConsecutiveOnes([1, 0, 1]) # 1
# print s.findMaxConsecutiveOnes([1]) # 1