public static int longestOnes(int[] nums,int k) { // write code here if (nums.length == 0) { return 0; } int left = 0; int right = 0; int maxLength = Integer.MIN_VALUE; int sumOne = 0; while (right < nums.length) { if (nums[right] == 0) { sumOne++; } while (sumOne > k) { if (nums[left] == 0) { sumOne--; } left++; } maxLength = Math.max(maxLength, right - left + 1); right++; } return maxLength; } 滑动窗口法