[easy] Max Consecutive Ones
leetCode/Array 101 2022. 4. 29. 19:17

문제 : 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