Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Qu
- {
- public static Queue<Integer> task(Queue<Integer>q,int k)
- {
- Queue<Integer> q2 = new Queue<Integer>();
- for(int i = 1 ; i <= k ; i ++)
- {
- if(!there(q,i))
- {
- q2.insert(i);
- }
- }
- return q2;
- }
- public static boolean there(Queue<Integer>q1 , int x)
- {
- Queue<Integer> temp = new Queue<Integer>();
- boolean flag = false;
- while(!q1.isEmpty())
- {
- if(q1.head() == x)
- {
- flag = true;
- }
- temp.insert(q1.remove());
- }
- while(!temp.isEmpty())
- {
- q1.insert(temp.remove());
- }
- return flag;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement