题目地址：https://leetcode.com/problems/max-consecutive-ones/description/
大意：给定一个数组，元素都是'0'或者'1'，求最大连续都是'1'的个数
思路：把数组转化成string然后用split()方法分割一下求最大的长度
# 485. Max Consecutive Ones
class Solution:
def findMaxConsecutiveOnes(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
s = ''.join(str(i) for i in nums)
list = s.split('0')
return max([len(item) for item in list])
D67 485. Max Consecutive Ones 题目链接 485. Max Consecutive O...
问题描述：【Array】485. Max Consecutive Ones 解题思路： 因为要找最长连续 1 子数...
题目地址：https://leetcode.com/problems/max-consecutive-ones/d...
485[思路]： 寻找0.1序列中连续为1的子序列的长度； 遍历一次，统计；
描述 Given a binary array, find the maximum number of conse...
Given a binary array, find the maximum number of consecut...
Input: [1,1,0,1,1,1]Output: 3Explanation: The first two d...
https://leetcode.com/problems/max-consecutive-ones/#/desc...
Given a binary array, find the maximum number of consecut...
Java
本文标题：485. Max Consecutive Ones
本文链接：https://www.haomeiwen.com/subject/idydmftx.html
网友评论