public int findMaxConsecutiveOnes(int[] nums) {
if (nums == null || nums.length == 0) {
Queue<Integer> zeroIndex = new LinkedList<>();
for (int start = 0, end = 0; end < nums.length; end++) {
if (zeroIndex.size() > k) {
start = zeroIndex.remove() + 1;
maxLen = Math.max(maxLen, end - start + 1);