Day 7: LeetCode 485. Max Consecutive Ones

Tag:随意刷-每月挑战(2021.09.21)

Source:

485. Max Consecutive Ones

1.题意:

如题目: 回传最长连续的1
In: binary array nums
Out: the maximum number of consecutive 1's in the array

2.思路:

• 遍历nums
  • 遇1则tmpLen++且更新最大连续1长度(maxLen)
  • 遇0则tmpLen归零

3.程序码:

Python3

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        
        maxLen = 0
        tmpLen = 0
        for i in nums:
            if i == 1:
                tmpLen+=1
                maxLen=max(maxLen,tmpLen)
            else:
                tmpLen=0
                
        return maxLen 

Java

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int tmpLen = 0;
        int maxLen = 0;
        for(int i=0;i<nums.length;i++)
        {
            if(nums[i]==1)
            {
                tmpLen++;
                maxLen=Math.max(tmpLen,maxLen);
            }
            else
            {
                tmpLen=0;
            }
        }
        return maxLen;
    }
}

Result:

Level:Easy