You are given a binary array nums (an array that contains only $0$s and $1$s). Your task is to find the maximum number of consecutive $1$s in the array and return it.

Constraints

• $1 \leq$ nums.length $\leq 10^3$

• nums[i] is either $0$ or $1$.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.