LeetCode-1004. Max Consecutive Ones III【Sliding Window】

1004. Max Consecutive Ones III

题目

Given an array A of 0s and 1s, we may change up to K values from 0 to 1.

Return the length of the longest (contiguous) subarray that contains only 1s.

Example 1:

Input: A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
Output: 6
Explanation:
[1,1,1,0,0,1,1,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.

Example 2:

Input: A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
Output: 10
Explanation:
[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.

Note:

1 <= A.length <= 20000
0 <= K <= A.length
A[i] is 0 or 1

算法

这道题用一种Sliding Window的思想，也就是滑动的窗口，j每循环一次+1，也就是窗口的尾指针每次后移一位，窗口长度随着0的个数而改变，0如果多于K，那么窗口头指针后移一位，计算当前窗口中subarray的和，如果比max大，那么max换成当前的值。

代码

int longestOnes(int* A, int ASize, int K) {
    int i = 0;
    int j;
    int numOfZero = 0;
    int max = 0;
    int current = 0;
    for(j = 0;j<ASize;j++){
        if(A[j]==0){
            numOfZero++;
        }
        if(numOfZero>K){
            if(A[i] == 0){
                numOfZero--;
            }
            i++;
        }
        current = j-i+1;
        if(current>max){
            max = current;
        }      
    }
    return max;
}