Problem Description
Given a binary array A, find the maximum sequence of continuous 1's that can be formed by replacing at-most B zeroes.
For this problem, return the indices of maximum continuous series of 1s in order.
If there are multiple possible solutions, return the sequence which has the minimum start index.
0 <= B <= 105
1 <= size(A) <= 105
0 <= A[i] <= 1
First argument is an binary array A.
Second argument is an integer B.
Return an array of integers denoting the indices(0-based) of 1's in the maximum continuous series.
Input 1:
A = [1 1 0 1 1 0 0 1 1 1 ] B = 1
Input 2:
A = [1, 0, 0, 0, 1, 0, 1] B = 2
Output 1:
[0, 1, 2, 3, 4]
Output 2:
[3, 4, 5, 6]
Explanation 1:
Flipping 0 present at index 2 gives us the longest continous series of 1's i.e subarray [0:4].
Explanation 2:
Flipping 0 present at index 3 and index 5 gives us the longest continous series of 1's i.e subarray [3:6].
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.