_1700.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.LinkedList;
importjava.util.Queue;

publicclass_1700 {
publicstaticclassSolution1 {
publicintcountStudents(int[] students, int[] sandwiches) {
Queue<Integer> studentsQueue = newLinkedList<>();
Queue<Integer> sandwichesQueue = newLinkedList<>();
for (inti = 0; i < sandwiches.length; i++) {
studentsQueue.add(students[i]);
sandwichesQueue.add(sandwiches[i]);
 }
do {
if (!studentsQueue.isEmpty()) {
if (studentsQueue.peek() == sandwichesQueue.peek()) {
studentsQueue.poll();
sandwichesQueue.poll();
 } else {
if (!studentsQueue.contains(sandwichesQueue.peek())) {
break;
 }
studentsQueue.add(studentsQueue.poll());
 }
 }
 } while (!studentsQueue.isEmpty());
returnstudentsQueue.size();
 }
 }
}