[LeetCode] 485. Max Consecutive Ones - 문제풀이
Description 주어진 배열에서 최대로 연속되는 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
