[C#][LeetCode][Easy] 485. Max Consecutive Ones

心得

傳入一個二進位的陣列,找出1最多連續出現的次數。

問題

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

1
2
3
4
5
6
7
8
9
10

Input: [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.
>
>

Note:

  • The input array will only contain 0 and 1.
  • The length of input array is a positive integer and will not exceed 10,000

答案

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

public class Solution {
public int FindMaxConsecutiveOnes(int[] nums) {
int maxcount = 0, count = 0;
for (int i = 0; i < nums.Length; i++)
{
if (nums[i] == 1)
{
count++;
}
else
{
if (maxcount < count)
{
maxcount = count;
}
count = 0;
}
}
return maxcount < count ? count : maxcount;
}
}