deque rend() function in C++ STL
The deque::rend() is an inbuilt function in C++ STL which returns a reverse iterator which points to the position before the beginning of the deque (which is considered its reverse end).
Syntax:
deque_name.rend()
Parameter: This function does not accept any parameters.
Return value: It returns a reverse iterator which points to the position before the beginning of the deque.
Below program illustrates the above function:
Program 1:
// C++ program to illustrate the// deque::rend() function#include <bits/stdc++.h>using namespace std; int main(){ deque<int> dq = { 10, 20, 30, 40, 50 }; cout << "The deque in reverse order: "; // prints the elements in reverse order for (auto it = dq.rbegin(); it != dq.rend(); ++it) cout << *it << " "; return 0;} |
Output:
The deque in reverse order: 50 40 30 20 10
Program 2:
// C++ program to illustrate the// deque::rend() function#include <bits/stdc++.h>using namespace std; int main(){ deque<char> dq = { 'a', 'b', 'c', 'd', 'e' }; cout << "The deque in reverse order: "; // prints the elements in reverse order for (auto it = dq.rbegin(); it != dq.rend(); ++it) cout << *it << " "; return 0;} |
Output:
The deque in reverse order: e d c b a
Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for foundation plus STL. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
