485. Max Consecutive Ones [Easy]

https://leetcode.com/problems/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

算法思路:

see the code

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int res = 0;
        int cnt = 0;
        for (int& x : nums) {
            if (x == 1) {
                cnt++;
            } else {
                res = max(res, cnt);
                cnt = 0;
            }
        }
        return max(res, cnt);
    }
};

 

©️2020 CSDN 皮肤主题: 技术黑板 设计师:CSDN官方博客 返回首页