Java中的java.util.ArrayDeque.poll()方法用於檢索或獲取並刪除Deque頭部的元素。 peek()方法僅檢索頭部的元素,但poll()也會隨著檢索而刪除該元素。如果雙端隊列為空,則返回NULL。
用法:
Array_Deque.poll()
參數:該方法不帶任何參數。
返回值:該方法刪除Deque頭部的元素並返回該元素。如果雙端隊列為空,則返回NULL。
下麵的程序演示了Java.util.ArrayDeque.poll()方法:
示例1:
// Java code to illustrate poll()
import java.util.*;
public class ArrayDequeDemo {
public static void main(String args[])
{
// Creating an empty ArrayDeque
Deque<String> de_que = new ArrayDeque<String>();
// 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]
示例2:
// Java code to illustrate poll()
import java.util.*;
public class ArrayDequeDemo {
public static void main(String args[])
{
// Creating an empty ArrayDeque
Deque<Integer> de_que = new ArrayDeque<Integer>();
// 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<Integer> de_que = new ArrayDeque<Integer>();
// 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
相關用法
- Java LinkedBlockingQueue poll()用法及代碼示例
- Java LinkedBlockingDeque poll()用法及代碼示例
- Java PriorityBlockingQueue poll()用法及代碼示例
- Java ArrayBlockingQueue poll()用法及代碼示例
- Java LinkedTransferQueue poll()用法及代碼示例
- Java ConcurrentLinkedQueue poll()用法及代碼示例
- Java PriorityQueue poll()用法及代碼示例
- Java ConcurrentLinkedDeque poll()用法及代碼示例
- Java Queue poll()用法及代碼示例
- Java DelayQueue poll()用法及代碼示例
- Java BlockingQueue poll()用法及代碼示例
- Java BlockingDeque poll()用法及代碼示例
- Java ArrayDeque pop()用法及代碼示例
- Java ArrayDeque add()用法及代碼示例
- Java ArrayDeque contains()用法及代碼示例
注:本文由純淨天空篩選整理自Chinmoy Lenka大神的英文原創作品 ArrayDeque poll() Method in Java。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。