485. Max Consecutive Ones

📋 Đề Bài

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 <= 10⁵
nums[i] is either 0 or 1.

💻 Lời Giải

C++ 0485-max-consecutive-ones.cpp

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