hacktoberfest_2022/Max Consecutive Ones.cpp at main · markandey007/hacktoberfest_2022 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

/*
485. Max Consecutive Ones
Easy

3513

411

Add to List

Share
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.

*/

// solution


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