LeetCode之Max Consecutive Ones

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        if (nums == null) {
            return 0;
        }
        int zero = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 0) {
                ++zero;
            }
        }
        if (zero == nums.length) {
            return 0;
        }
        int count = 0;
        int maxValue = 0;
        int maxLength = 0;
        for (int i = 0; i < nums.length; ++i) {
            if (nums[i] > maxValue) {
                maxValue = nums[i];
            }
        }
        for (int i = 0; i < nums.length; ++i) {
            if (nums[i] == maxValue) {
                for (int j = i; j < nums.length; ++j) {
                    if (nums[j] == maxValue) {
                        count++;
                    } else {
                        break;
                    }
                }
                if (maxLength < count) {
                    maxLength = count;
                }
                count = 0;
            }
        }
        return maxLength;
    }
}