[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;
    }
};

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

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试