Java.util.ArrayDeque.descendingIterator()方法用於返回與ArrayDeque相同的元素的迭代器,但順序相反。
用法:
Iterator iterate_value = Array_Deque.descendingIterator();
參數:該方法不帶任何參數。
返回值:該方法遍曆雙端隊列的元素,並以相反的順序返回值(迭代器)。
以下程序說明了Java.util.ArrayDeque.descendingIterator()方法:
程序1:
// Java code to illustrate descendingIterator()
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 Queue
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);
// Creating a desc_iterator
Iterator value = de_que.descendingIterator();
// Displaying the values after iterating through the Deque
// in reverse order
System.out.println("The iterator values are: ");
while (value.hasNext()) {
System.out.println(value.next());
}
}
}
輸出:
ArrayDeque: [Welcome, To, Geeks, 4, Geeks] The iterator values are: Geeks 4 Geeks To Welcome
程序2:
// Java code to illustrate descendingIterator()
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 Queue
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);
// Creating a desc_iterator
Iterator value = de_que.descendingIterator();
// Displaying the values after iterating through the Deque
// in reverse order
System.out.println("The iterator values are: ");
while (value.hasNext()) {
System.out.println(value.next());
}
}
}
輸出:
ArrayDeque: [10, 15, 30, 20, 5] The iterator values are: 5 20 30 15 10
相關用法
- Java NavigableSet descendingIterator()用法及代碼示例
- Java Deque descendingIterator()用法及代碼示例
- Java LinkedBlockingDeque descendingIterator()用法及代碼示例
- Java ConcurrentLinkedDeque descendingIterator()用法及代碼示例
- Java ConcurrentSkipListSet descendingIterator()用法及代碼示例
- Java TreeSet descendingIterator()用法及代碼示例
- Java LinkedList descendingIterator()用法及代碼示例
- Java ArrayDeque contains()用法及代碼示例
- Java ArrayDeque add()用法及代碼示例
- Java ArrayDeque pop()用法及代碼示例
- Java ArrayDeque remove()用法及代碼示例
- Java ArrayDeque offer()用法及代碼示例
- Java ArrayDeque toArray()用法及代碼示例
- Java ArrayDeque removeLast()用法及代碼示例
- Java ArrayDeque removeFirst()用法及代碼示例
注:本文由純淨天空篩選整理自Chinmoy Lenka大神的英文原創作品 ArrayDeque descendingIterator() Method in Java。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。