Skip to content

Commit eaac131

Browse files
authored
Merge pull request #37 from Saurabh2509/main
Add files via upload
2 parents 5dedb79 + 2101153 commit eaac131

File tree

1 file changed

+40
-0
lines changed

1 file changed

+40
-0
lines changed

Arraydeque.java

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
///Implementaion of Deque using ArrayDeque
2+
//--->ArrayDeque does not support concurrent access by multiple threads.
3+
//-->ArrayDeque class is likely to be faster than Stack when used as a stack.
4+
//-->ArrayDeque class is likely to be faster than LinkedList when used as a queue.
5+
import java.util.*;
6+
7+
public class Arraydeque
8+
{
9+
static Scanner sc = new Scanner(System.in);
10+
public static void main(String[] args) {
11+
Deque<Integer> deque = new ArrayDeque<Integer>();
12+
13+
for (int i=0;i<6;i++){
14+
deque.add(sc.nextInt());
15+
}
16+
System.out.println(deque);
17+
//add at end
18+
deque.add(23);
19+
//add at first
20+
deque.addFirst(25);
21+
//add at last
22+
deque.addLast(46);
23+
// get first
24+
System.out.println(deque.getFirst());
25+
// get Last
26+
System.out.println(deque.getLast());
27+
//push element at head;
28+
deque.push(89);
29+
System.out.println(deque);
30+
//pop element from end
31+
deque.pop();
32+
System.out.println(deque);
33+
//remove element first element
34+
deque.removeFirst();
35+
System.out.println(deque);
36+
// remove last element
37+
deque.removeLast();
38+
System.out.println(deque);
39+
}
40+
}

0 commit comments

Comments
 (0)