Java Queue poll()用法及代碼示例

隊列接口的poll()方法返回並移除容器前麵的元素。它刪除容器中的元素。當Queue為空時，該方法不會引發異常，而是返回null。

用法:

E poll()

返回值：此方法返回位於容器前麵或隊列開頭的元素。當隊列為空時，它返回null。

以下示例程序旨在說明隊列的poll()方法：

示例1:借助LinkedList。

// Java Program Demonstrate poll() 
// method of Queue 
  
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws IllegalStateException 
    { 
  
        // create object of Queue 
        Queue<Integer> Q 
            = new LinkedList<Integer>(); 
  
        // Add numbers to end of Queue 
        Q.add(7855642); 
        Q.add(35658786); 
        Q.add(5278367); 
        Q.add(74381793); 
  
        // print queue 
        System.out.println("Queue: " + Q); 
  
        // print head and deletes the head 
        System.out.println("Queue's head: " + Q.poll()); 
  
        // print head and deleted the head 
        System.out.println("Queue's head: " + Q.poll()); 
    } 
}

輸出：

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

示例2:在隊列為空時演示隊列的poll()方法

// Java Program Demonstrate poll() 
// method of Queue when the Queue becomes empty 
  
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws IllegalStateException 
    { 
  
        // create object of Queue 
        Queue<Integer> Q 
            = new LinkedList<Integer>(); 
  
        // Add numbers to end of Queue 
        Q.add(423); 
        Q.add(3432); 
  
        // print queue 
        System.out.println("Queue: " + Q); 
  
        // print head and deletes the head 
        System.out.println("Queue's head: " + Q.poll()); 
  
        // print head and deleted the head 
        System.out.println("Queue's head: " + Q.poll()); 
  
        // print queue 
        System.out.println("Queue: " + Q); 
  
        // print null as Queue is empty now 
        System.out.println("Queue's head: " + Q.poll()); 
    } 
}

輸出：

Queue: [423, 3432]
Queue's head: 423
Queue's head: 3432
Queue: []
Queue's head: null

示例3:借助ArrayDeque。

// Java Program Demonstrate poll() 
// method of Queue 
  
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws IllegalStateException 
    { 
  
        // create object of Queue 
        Queue<Integer> Q 
            = new ArrayDeque<Integer>(); 
  
        // Add numbers to end of Queue 
        Q.add(7855642); 
        Q.add(35658786); 
        Q.add(5278367); 
        Q.add(74381793); 
  
        // print queue 
        System.out.println("Queue: " + Q); 
  
        // print head and deletes the head 
        System.out.println("Queue's head: " + Q.poll()); 
  
        // print head and deleted the head 
        System.out.println("Queue's head: " + Q.poll()); 
    } 
}

輸出：

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

示例4:借助ConcurrentLinkedDeque。

// Java Program Demonstrate poll() 
// method of Queue 
  
import java.util.*; 
import java.util.concurrent.ConcurrentLinkedDeque; 
  
public class GFG { 
    public static void main(String[] args) 
        throws IllegalStateException 
    { 
  
        // create object of Queue 
        Queue<Integer> Q 
            = new ConcurrentLinkedDeque<Integer>(); 
  
        // Add numbers to end of Queue 
        Q.add(7855642); 
        Q.add(35658786); 
        Q.add(5278367); 
        Q.add(74381793); 
  
        // print queue 
        System.out.println("Queue: " + Q); 
  
        // print head and deletes the head 
        System.out.println("Queue's head: " + Q.poll()); 
  
        // print head and deleted the head 
        System.out.println("Queue's head: " + Q.poll()); 
    } 
}

輸出：

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

示例5:借助LinkedBlockingDeque。

// Java Program Demonstrate poll() 
// method of Queue 
  
import java.util.*; 
import java.util.concurrent.LinkedBlockingDeque; 
  
public class GFG { 
    public static void main(String[] args) 
        throws IllegalStateException 
    { 
  
        // create object of Queue 
        Queue<Integer> Q 
            = new LinkedBlockingDeque<Integer>(); 
  
        // Add numbers to end of Queue 
        Q.add(7855642); 
        Q.add(35658786); 
        Q.add(5278367); 
        Q.add(74381793); 
  
        // print queue 
        System.out.println("Queue: " + Q); 
  
        // print head and deletes the head 
        System.out.println("Queue's head: " + Q.poll()); 
  
        // print head and deleted the head 
        System.out.println("Queue's head: " + Q.poll()); 
    } 
}

輸出：

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

參考： https://docs.oracle.com/javase/8/docs/api/java/util/Queue.html#poll–

相關用法

注：本文由純淨天空篩選整理自gopaldave大神的英文原創作品 Queue poll() method in Java。非經特殊聲明，原始代碼版權歸原作者所有，本譯文未經允許或授權，請勿轉載或複製。