485. Max Consecutive Ones

最新推荐文章于 2019-06-11 20:30:00 发布

weixin_34241036

最新推荐文章于 2019-06-11 20:30:00 发布

阅读量140

点赞数

原文链接：http://www.cnblogs.com/xiuxiu55/p/6504114.html

版权

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) {
        if(nums.size()==0)
            return 0;
            
        int cnt = 0;
        int max = 0;
        for(int i =0;i<nums.size();i++){
            if(nums[i] == 1){
                ++cnt;
            }else{
                max = max>cnt?max:cnt;
                cnt = 0;
            }
        }
        
        int res = max>cnt?max:cnt;
        return res;
        
    }
};