The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches. The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a stack. At each step: If the student at the front of the queue prefers the sandwich on the top of the stack, they will take it and leave the queue. Otherwise, they will leave it and go to the queue's end. This continues until none of the queue students want to take the top sandwich and are thus unable to eat. You are given two integer arrays students and sandwiches where sandwiches[i] is the type of the ith sandwich in the stack (i = 0 is the top of the stack) and students[j] is the preference of the jth student in the initial queue (j = 0 is the front of the queue). Return the number of students that are unable to eat. use the following code to complete:- import java.util.LinkedList; import java.util.Queue; public class MyQueue{ public int countStudents(int[] students, int[] sandwiches) { Queue q = new LinkedList<>(); } } use only the imported classes [mport java.util.LinkedList; import java.util.Queue;]

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches.

The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a stack. At each step:

If the student at the front of the queue prefers the sandwich on the top of the stack, they will take it and leave the queue.
Otherwise, they will leave it and go to the queue's end.

This continues until none of the queue students want to take the top sandwich and are thus unable to eat.

You are given two integer arrays students and sandwiches where sandwiches[i] is the type of the i^th sandwich in the stack (i = 0 is the top of the stack) and students[j] is the preference of the j^th student in the initial queue (j = 0 is the front of the queue). Return the number of students that are unable to eat.

use the following code to complete:-

import java.util.LinkedList;
import java.util.Queue;
public class MyQueue{
public int countStudents(int[] students, int[] sandwiches) {
Queue<Integer> q = new LinkedList<>();
}
}

use only the imported classes [mport java.util.LinkedList;
import java.util.Queue;]

Input: students = [1,1,0,0], sandwiches = [0,1,0,1]
Output: 0
Explanation:
- Front student leaves the top sandwich and returns to the end of the line
making students = [1,0,0,1].
- Front student leaves the top sandwich and returns to the end of the line
making students = [0,0,1,1].
Front student takes the top sandwich and leaves the line making students =
[0,1,1] and sandwiches
[1,0,1].
Front student leaves the top sandwich and returns to the end of the line
making students
[1,1,0].
- Front student takes the top sandwich and leaves the line making students =
[1,0] and sandwiches
[0,1].
- Front student leaves the top sandwich and returns to the end of the line
making students = [0,1].
- Front student takes the top sandwich and leaves the line making students =
[1] and sandwiches = [1].
Front student takes the top sandwich and leaves the line making students =
[] and sandwiches = [].
Hence all students are able to eat.
=
=
=

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions