刚开始学习Python编程,欢迎交流学习!!
485.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
思路:按 “0” 去分割数组(得先将数组中的整数元素变成字符串),然后统计各个数组的长度,返回最大值就可以了。(Ps:这个思路效率很低,后续有改进的地方会再更)
代码:
class Solution:
def findMaxConsecutiveOnes(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
new_list = []
b = 0
for i in range(len( nums)):
new_list.append(str( nums[i]))
L = "".join(new_list)
new_ = L.split("0")
for each in new_:
if len(each) > b:
b = len(each)
return b