mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-10 16:00:36 +08:00
14c314c08c
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
47 lines
1.6 KiB
Java
47 lines
1.6 KiB
Java
/**
|
|
* File: deque.java
|
|
* Created Time: 2022-11-25
|
|
* Author: krahets (krahets@163.com)
|
|
*/
|
|
|
|
package chapter_stack_and_queue;
|
|
|
|
import java.util.*;
|
|
|
|
public class deque {
|
|
public static void main(String[] args) {
|
|
/* Initialize the deque */
|
|
Deque<Integer> deque = new LinkedList<>();
|
|
deque.offerLast(3);
|
|
deque.offerLast(2);
|
|
deque.offerLast(5);
|
|
System.out.println("Deque deque = " + deque);
|
|
|
|
/* Access an element */
|
|
int peekFirst = deque.peekFirst();
|
|
System.out.println("Front element peekFirst = " + peekFirst);
|
|
int peekLast = deque.peekLast();
|
|
System.out.println("Rear element peekLast = " + peekLast);
|
|
|
|
/* Enqueue elements */
|
|
deque.offerLast(4);
|
|
System.out.println("After enqueuing element 4 at the rear, deque = " + deque);
|
|
deque.offerFirst(1);
|
|
System.out.println("After enqueuing element 1 at the front, deque = " + deque);
|
|
|
|
/* Dequeue an element */
|
|
int popLast = deque.pollLast();
|
|
System.out.println("Element dequeued from the rear = " + popLast + ", after dequeuing from the rear, deque = " + deque);
|
|
int popFirst = deque.pollFirst();
|
|
System.out.println("Element dequeued from the front = " + popFirst + ", after dequeuing from the front, deque = " + deque);
|
|
|
|
/* Get the deque size */
|
|
int size = deque.size();
|
|
System.out.println("Deque size = " + size);
|
|
|
|
/* Check whether the deque is empty */
|
|
boolean isEmpty = deque.isEmpty();
|
|
System.out.println("Is the deque empty = " + isEmpty);
|
|
}
|
|
}
|