【Leetcode】 485. 最大连续 1 的个数

Given a binary array nums, return the maximum number of consecutive 1’s in the array.

Example 1:

Input: nums = [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.

Example 2:

Input: nums = [1,0,1,1,0,1]
Output: 2

Constraints:

1 <= nums.length <= 105
nums[i] is either 0 or 1.

---

【个人思路】:

• 一次遍历即可，当循环到 1 时，就开始计数，然后将最大所计的数取出。
• 对于变成而言，需要值得注意的是：每次取完 maxCount 后，count = 0;

AC:

/*
 * @lc app=leetcode.cn id=485 lang=cpp
 *
 * [485] 最大连续 1 的个数
 */

// @lc code=start
class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int n = nums.size();
        int maxCount = 0, count = 0;
        for(int i = 0; i < n; i++)
        {
            if(nums[i] == 1)
            {
                count++;
            } else 
            {
                maxCount = max(count, maxCount);
                count = 0;
            }
        }
        maxCount = max(count, maxCount);
        return maxCount;
    }
};
// @lc code=end

---