Find Minimum SubArray

import java.util.LinkedList;
import java.util.Queue;

/*
 * Question:
   
   Given an array containing only 0s and 1s, find the minimum size of sub array containing exactly k-zeros.
    Ex. 11010100011   k=4
    result = 5(01000)

 * Solution:
 *
 * Runtime: O(n)
 * Space time: O(n)
 */

public class MinSubArrayQuestion1 {

public void findMinSubArr(int[] arr, int k) {

Queue queue = new LinkedList();
int minSubArrSize = arr.length;

for (int i = 0; i < arr.length; i++) {

if(arr[i] == 0) {

if(queue.size() != k){
queue.add(i);
}
else {
if(minSubArrSize > i - queue.peek() + 1) {
minSubArrSize = i - queue.peek() + 1;
}
queue.remove();
queue.add(i);
}
}
}


// Printing result.
if(queue.size() == k) {
System.out.print("Min SubArray : ");

for(int i = queue.peek(); queue.size() != 0; i++) {

if(i == queue.peek())
queue.remove();

System.out.print(arr[i]);
}
}
else {
System.out.println("No subarray found");
}
}


public static void main(String args[]) {

int[] arr = { 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1 };
new MinSubArrayQuestion1().findMinSubArr(arr, 5);
}

}