complete this code : •Write a method that takes 3 queues: q1 and q2 contain some
ID: 3703988 • Letter: C
Question
complete this code :
•Write a method that takes 3 queues: q1 and q2 contain some elements, q3 is initially empty, your method should find the common elements between q1 and q2 and put them q3.
import java.util.*;
public class MyQ {
public int size;
public LinkedList list = null;
public MyQ() {
list = new LinkedList();
size = 0;
}
public boolean isEmpty() {
return size == 0;
}
public int qzize() {
return size;
}
public void enqueue(Object newElement) {
list.addLast(newElement);
size++;
}
public Object dequeue() {
if (isEmpty()) {
throw new RuntimeException(" Hay , Q is empty ! ");
}
size--;
return list.removeFirst();
}
public void displayAll() {
Iterator it = list.iterator();
while (it.hasNext()) {
System.out.println(it.next());
}
}
public static void main(String[] args) {
MyQ qList = new MyQ();
System.out.println(qList.isEmpty());
qList.enqueue(1);
qList.enqueue(6);
qList.enqueue(7);
qList.enqueue(8);
qList.displayAll();
System.out.println("size : " + qList.size);
qList.dequeue();
qList.dequeue();
qList.displayAll();
System.out.println("size : " + qList.size);
Explanation / Answer
import java.util.*;
public class MyQ {
public int size;
public LinkedList list = null;
public MyQ() {
list = new LinkedList();
size = 0;
}
public boolean isEmpty() {
return size == 0;
}
public int qzize() {
return size;
}
public void enqueue(Object newElement) {
list.addLast(newElement);
size++;
}
public Object dequeue() {
if (isEmpty()) {
throw new RuntimeException(" Hay , Q is empty ! ");
}
size--;
return list.removeFirst();
}
public void displayAll() {
Iterator it = list.iterator();
while (it.hasNext()) {
System.out.println(it.next());
}
}
void CommonElement(MyQ q1, MyQ q2, MyQ q3){
Iterator it = q1.list.iterator();
Iterator it2 = q2.list.iterator();
while (it.hasNext()) {
Object obj = it.next();
while (it2.hasNext()) {
Object obj2 = it2.next();
if(obj2==obj){
q3.enqueue(obj2);
break;
}
}
}
}
public static void main(String[] args) {
MyQ qList = new MyQ();
System.out.println(qList.isEmpty());
qList.enqueue(1);
qList.enqueue(6);
qList.enqueue(7);
qList.enqueue(8);
qList.displayAll();
System.out.println("size : " + qList.size);
qList.dequeue();
qList.dequeue();
qList.displayAll();
System.out.println("size : " + qList.size);
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.