-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestion.java
More file actions
46 lines (44 loc) · 1.41 KB
/
Copy pathquestion.java
File metadata and controls
46 lines (44 loc) · 1.41 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.awt.*;
import java.util.ArrayDeque;
import java.util.Queue;
public class question {
static class Novel{
String name;
boolean avaiable;
Novel(String name, boolean avaiable){
this.name = name;
this.avaiable = avaiable;
}
}
static Queue<Integer> inputQueue;
public static void main(String[] args){
Novel n1 = new Novel("xyz", true);
Novel n3 = n1;
}
//inputQueue (Front -> Rear): [2 ,7 , 4 ,6, 5, 1 ,23 ,20 ,12 ,2];
// public static Queue obtainQueue(Queue inputQueue) {
// ;
// Queue outputQueue = new Queue(20);
// while(!(inputQueue().isEmpty())){
// int element1 = inputQueue().dequeue();
// int element2 = inputQueue().dequeue();
// if(!(inputQueue().isEmpty())){
// int element3 = inputQueue().dequeue();
// if(element2 > (element1 + element3)){
// outputQueue.enqueue(element1 + element2);
// outputQueue.enqueue(element3);
// inputQueue().enqueue(element1 *2);
// }else{
// outputQueue.enqueue(element1 - element2);
// outputQueue.enqueue(element2);
// }
//
// }
// else{
// outputQueue.enqueue(element1);
// }
// }
// return outputQueue;
//
// }
}