📌  相关文章
📜  Java中的 ConcurrentLinkedDeque pollLast() 方法

📅  最后修改于: 2022-05-13 01:55:45.445000             🧑  作者: Mango

Java中的 ConcurrentLinkedDeque pollLast() 方法

Java.util.concurrent.ConcurrentLinkedDeque.pollLast()是Java中的一个内置方法,它检索双端队列的最后一个元素并将其删除。如果双端队列为空,则该方法返回NULL

句法:

Conn_Linked_Deque.pollLast()

参数:该函数不接受任何参数。

返回值:该函数返回双端队列的最后一个元素。如果双端队列为空,则函数返回NULL

下面的程序说明了 pollFirst() 方法的使用:

程序 1:该程序涉及带有Integer元素的双端队列。

/* Java Program Demonstrate pollLast() 
 method of ConcurrentLinkedDeque   */
  
import java.util.concurrent.*;
  
class ConcurrentLinkedDequeDemo {
    public static void main(String[] args)
    {
        ConcurrentLinkedDeque cld = 
                     new ConcurrentLinkedDeque();
  
        cld.addFirst(12);
        cld.addFirst(70);
        cld.addFirst(1009);
        cld.addFirst(475);
  
        // Displaying the existing LinkedDeque
        System.out.println("Elements in"
                           + "the LinkedDeque: " + cld);
  
        // Display and remove the Last element
        System.out.println("Element removed : "
                           + cld.pollLast());
  
        // Displaying the elements
        System.out.println("Elements in"
                           + "the LinkedDeque: " + cld);
    }
}
输出:
Elements inthe LinkedDeque: [475, 1009, 70, 12]
Element removed : 12
Elements inthe LinkedDeque: [475, 1009, 70]

程序 2:该程序涉及带有String元素的双端队列。

/* Java Program Demonstrate pollLast() 
 method of ConcurrentLinkedDeque   */
  
import java.util.concurrent.*;
  
class ConcurrentLinkedDequeDemo {
    public static void main(String[] args)
    {
        ConcurrentLinkedDeque cld = 
                       new ConcurrentLinkedDeque();
  
        cld.addFirst("GFG");
        cld.addFirst("Geeks");
        cld.addFirst("Gfg");
        cld.addFirst("Geeks");
  
        // Displaying the existing LinkedDeque
        System.out.println("Elements in"
                           + "the LinkedDeque: " + cld);
  
        // Display and remove the Last element
        System.out.println("Element removed : "
                           + cld.pollLast());
  
        // Displaying the elements
        System.out.println("Elements in"
                           + "the LinkedDeque: " + cld);
    }
}
输出:
Elements inthe LinkedDeque: [Geeks, Gfg, Geeks, GFG]
Element removed : GFG
Elements inthe LinkedDeque: [Geeks, Gfg, Geeks]

参考: https: Java/util/concurrent/ConcurrentLinkedDeque.html#pollLast()