[leetcode] 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

代码:

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int longest = 0;
        int curlongest = 0;
        for(int i = 0; i < nums.size(); i++){
            if(nums[i] == 1) curlongest++;
            else{
                if(curlongest > longest) longest = curlongest;
                curlongest = 0;
            }
        }
        if(curlongest > longest) longest = curlongest;
        return longest;
    }
};

阅读更多
个人分类: leetcode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

[leetcode] 485. Max Consecutive Ones

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭