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

时间：2022-01-27 14:19:12

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

找出一个二进制串中连续的1的个数。

    

  1. static public int FindMaxConsecutiveOnes(int[] nums) {
    2. 

  2. 	if (nums.Length == 0) {
    3. 

  3. 		return 0;
    4. 

  4. 	}
    5. 

  5. 	int maxNumber = 0;
    6. 

  6. 	int number = 0;
    7. 

  7. 	for (int i = 0; i <= nums.Length; i++) {
    8. 

  8. 		if (i != nums.Length && nums[i] == 1) {
    9. 

  9. 			number++;
    10. 

  10. 		} else {
    11. 

  11. 			if (number > maxNumber) {
    12. 

  12. 				maxNumber = number;
    13. 

  13. 			}
    14. 

  14. 			number = 0;
    15. 

  15. 		}
    16. 

  16. 	}
    17. 

  17. 	return maxNumber;
    18. 

  18. }
    19.

相关文章