- 1 public class Solution {
- 2 public int findMaxConsecutiveOnes(int[] nums) {
- 3 int res = 0;
- 4 int zero = 0;
- 5 int k = 1;
- 6 7
- for (int walker = 0, runner = 0; runner) {
- 8
- if (nums[runner] == 0) {
- 9 zero++;
- 10
- }
- 11
- while (zero > k) {
- 12
- if (nums[walker++] == 0) {
- 13 zero--;
- 14
- }
- 15
- }
- 16 res = Math.max(res, runner - walker + 1);
- 17
- }
- 18 19
- return res;
- 20
- }
- 21
- }
来源: