-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdequeues.java
More file actions
43 lines (41 loc) · 1.09 KB
/
Copy pathdequeues.java
File metadata and controls
43 lines (41 loc) · 1.09 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
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Iterator;
import java.util.Scanner;
public class dequeues
{
public static void main(String[] args)
{
Deque<Integer> d = new ArrayDeque<>();
d.add(4);
d.addFirst(2);
d.addLast(3);
System.out.println(d);
System.out.println(d.contains(3));
System.out.println(d.element());
System.out.println(d.getFirst());
System.out.println(d.removeFirst());
System.out.println(d.removeFirst());
System.out.println(d.removeFirst());
System.out.println(d.pollFirst());
d.offer(1);
d.offer(4);
d.offer(5);
d.offer(9);
d.offer(0);
System.out.println(d);
System.out.println(d.poll());
System.out.println(d);
Iterator itr = d.iterator();
while(itr.hasNext())
{
System.out.print(d.poll());
}
d.offer(1);
d.offer(4);
d.offer(5);
d.offer(9);
d.offer(0);
Iterator ditr = d.descendingIterator();
}
}