Java中的ArrayDeque poll() 方法

Java中的Java .util.ArrayDeque.poll() 方法用于检索或获取和删除出现在 Deque 头部的元素。 peek() 方法仅检索头部的元素，但 poll() 也会在检索时删除该元素。如果双端队列为空，则返回 NULL。

句法：

Array_Deque.poll()

参数：该方法不带任何参数。

返回值：该方法删除 Deque 头部的元素并返回相同的元素。如果双端队列为空，则返回 NULL。

下面的程序说明了Java.util.ArrayDeque.poll() 方法：
方案一：

// Java code to illustrate poll()
import java.util.*;
  
public class ArrayDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ArrayDeque
        Deque de_que = new ArrayDeque();
  
        // Use add() method to add elements into the Deque
        de_que.add("Welcome");
        de_que.add("To");
        de_que.add("Geeks");
        de_que.add("4");
        de_que.add("Geeks");
  
        // Displaying the ArrayDeque
        System.out.println("ArrayDeque: " + de_que);
  
        // Displaying the head
        System.out.println("The element at head is: " 
                                           + de_que.poll());
  
        // Displaying the final ArrayDeque
        System.out.println("ArrayDeque after operation: " 
                                                   + de_que);
    }
}

输出：

ArrayDeque: [Welcome, To, Geeks, 4, Geeks]
The element at head is: Welcome
ArrayDeque after operation: [To, Geeks, 4, Geeks]

方案二：

// Java code to illustrate poll()
import java.util.*;
  
public class ArrayDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ArrayDeque
        Deque de_que = new ArrayDeque();
  
        // Use add() method to add elements into the Deque
        de_que.add(10);
        de_que.add(15);
        de_que.add(30);
        de_que.add(20);
        de_que.add(5);
  
        // Displaying the ArrayDeque
        System.out.println("ArrayDeque: " + de_que);
  
        // Displaying the head
        System.out.println("The element at head is: " 
                                         + de_que.poll());
  
        // Displaying the final ArrayDeque
        System.out.println("ArrayDeque after operation: "
                                                 + de_que);
    }
}

输出：

ArrayDeque: [10, 15, 30, 20, 5]
The element at head is: 10
ArrayDeque after operation: [15, 30, 20, 5]

程序 3：对于一个空的双端队列：

// Java code to illustrate poll()
import java.util.*;
  
public class ArrayDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ArrayDeque
        Deque de_que = new ArrayDeque();
  
        // Displaying the ArrayDeque
        System.out.println("ArrayDeque: " + de_que);
  
        // Displaying the head
        System.out.println("The element at head is: " + 
                                           de_que.poll());
    }
}

输出：

ArrayDeque: []
The element at head is: null