All files / leetCode 0485.ts

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 
2x
2x
 
2x
12x
9x
 
3x
3x
 
 
 
2x
2x
 
 
export default function findMaxConsecutiveOnes(nums: number[]): number {
  let max = 0
  let count = 0
 
  for (let i = 0; i < nums.length; i++) {
    if (nums[i] === 1) {
      count++
    } else {
      max = Math.max(max, count)
      count = 0
    }
  }
 
  max = Math.max(max, count)
  return max
}