[LeetCode] Challenge log 485

Posted on | Edited on |
485. Max Consecutive Ones

Self explained.

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

Example 1:

1
2
3
4
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
Soulution:
1
2
3
4
5
6
7
class Solution:
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return max([len(x) for x in ''.join([str(y) for y in nums]).split('0')])

or more pythonic:

1
2
3
4
5
6
7
class Solution:
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return max([len(x) for x in ''.join([str(y) for y in nums]).split('0')])
0%