Java ArrayDeque pop方法 Java ArrayDeque pollLast方法 Java ArrayDeque push方法 Java ArrayDeque pop方法 package com.codingdict; import java.util.ArrayDeque; import java.util.Deque; public class ArrayDequeDemo { public static void main(String[] args) { // create an empty array deque with an initial capacity Deque<Integer> deque = new ArrayDeque<Integer>(8); // use add() method to add elements in the deque deque.add(25); deque.add(30); deque.add(20); deque.add(18); // printing all the elements available in deque for (Integer number : deque) { System.out.println("Number = " + number); } int retval = deque.pop(); System.out.println("Element removed is " + retval); // printing all the elements available in deque after using pop() for (Integer number : deque) { System.out.println("Number = " + number); } } } Java ArrayDeque pollLast方法 Java ArrayDeque push方法