485. 找出二进制串中连续的1的个数 Max Consecutive Ones

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

Example 1:

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

static public int FindMaxConsecutiveOnes(int[] nums) {
	if (nums.Length == 0) {
		return 0;
	}
	int maxNumber = 0;
	int number = 0;
	for (int i = 0; i <= nums.Length; i++) {
		if (i != nums.Length && nums[i] == 1) {
			number++;
		} else {
			if (number > maxNumber) {
				maxNumber = number;
			}
			number = 0;
		}
	}
	return maxNumber;
}