【数组相关】485. 最大连续1的个数

原题链接：https://leetcode-cn.com/problems/max-consecutive-ones/

---

---

借助选择排序的思想，当前和之后的元素进行比较，如果连续是1就累加，最终得到最大的累加即结果

动画如下:

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