# 485.max-consecutive-ones

## Statement

``````输入：nums = [1,1,0,1,1,1]

``````

``````输入：nums = [1,0,1,1,0,1]

``````

• `1 <= nums.length <= 105`
• `nums[i]` 不是 `0` 就是 `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`.

## Solution

``````#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define endl "\n"
#define fi first
#define se second
#define all(x) begin(x), end(x)
#define rall rbegin(a), rend(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define complete_unique(a) a.erase(unique(begin(a), end(a)), end(a))
#define mst(x, a) memset(x, a, sizeof(x))
#define MP make_pair

using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
using VLL = std::vector<ll>;
using VI = std::vector<int>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = 1e9 + 7;

template <typename T, typename S>
inline bool chmax(T &a, const S &b) {
return a < b ? a = b, 1 : 0;
}

template <typename T, typename S>
inline bool chmin(T &a, const S &b) {
return a > b ? a = b, 1 : 0;
}

#ifdef LOCAL
#include <debug.hpp>
#else
#define dbg(...)
#endif

class Solution {
public:
int findMaxConsecutiveOnes(vector<int> &nums) {
int res = 0;
int cur = 0;

for (auto &a : nums) {
if (a == 1) {
++cur;
res = max(res, cur);
} else {
cur = 0;
}
}

return res;
}
};

#ifdef LOCAL

int main() {
return 0;
}

#endif
``````