Max Consecutive Ones III LeetCode solution in Java

1
class Solution {
2
  public int longestOnes(int[] nums, int k) {
3
    int ans = 0;
4
    int j = -1;
5
    int count = 0;
6
    for (int i = 0; i < nums.length; i++) {
7
      if (nums[i] == 0) {
8
        count++;
9
      }
10
      while (count > k) {
11
        j++;
12
        if (nums[j] == 0) {
13
          count--;
14
        }
15
      }
16
      int len = i - j;
17
      if (len > ans) ans = len;
18
    }
19
    return ans;
20
  }
21
}