LeetCode Max Consecutive Ones

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:
Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s.
The maximum number of consecutive 1s is 3.
Note:

The input array will only contain 0 and 1.
The length of input array is a positive integer and will not exceed 10,000

class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: list[int]
        :rtype: int
        """
        mmax = 0
        count = 0
        for i in nums:
            if i == 1:
                count += 1
            else:
                if count > mmax:
                    mmax = count
                count = 0
        if count>mmax:
            mmax=count

        return mmax

class Solution2(object):
    def findMaxConsecutiveOnes(self, nums):
        return max(map(len, ''.join(map(str, nums)).split('0')))  #效率低一點，但是比較另類

if __name__ == '__main__':
    print Solution().findMaxConsecutiveOnes([1, 1, 0, 1, 1, 1])