algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-06 22:34:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the test cases of deque.

Browse Source
This commit is contained in:
Yudong Jin
2023-01-29 13:34:37 +08:00
parent 7060433b9d
commit e308657ae9
2 changed files with 36 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
codes/java/chapter_stack_and_queue/deque.java
View File

@ -12,13 +12,9 @@ public class deque {
public static void main(String[] args) {
/* 初始化双向队列 */
Deque<Integer> deque = new LinkedList<>();
/* 元素入队 */
deque.offerLast(3);
deque.offerLast(2);
deque.offerLast(5);
deque.offerLast(4);
deque.offerFirst(3);
deque.offerFirst(1);
System.out.println("双向队列 deque = " + deque);
/* 访问元素 */
@ -27,11 +23,17 @@ public class deque {
int peekLast = deque.peekLast();
System.out.println("队尾元素 peekLast = " + peekLast);
/* 元素入队 */
deque.offerLast(4);
System.out.println("元素 4 队尾入队后 deque = " + deque);
deque.offerFirst(1);
System.out.println("元素 1 队首入队后 deque = " + deque);
/* 元素出队 */
int pollFirst = deque.pollFirst();
System.out.println("队首出队元素 pollFirst = " + pollFirst + "，队首出队后 deque = " + deque);
int pollLast = deque.pollLast();
System.out.println("队尾出队元素 pollLast = " + pollLast + "，队尾出队后 deque = " + deque);
System.out.println("队尾出队元素 = " + pollLast + "，队尾出队后 deque = " + deque);
int pollFirst = deque.pollFirst();
System.out.println("队首出队元素 = " + pollFirst + "，队首出队后 deque = " + deque);
/* 获取双向队列的长度 */
int size = deque.size();