stl vector 函數

C ++ vector :: crend()函數 (C++ vector::crend() function)

vector::crend() is a library function of "vector" header, it is used to get the first element of a vector from reverse ending, it returns a const reverse iterator pointing to the element preceding the first element (i.e. reverse ending) of a vector.

vector :: crend()是“ vector”頭文件的庫函數，用于從反向結尾獲取向量的第一個元素，它返回一個const反向迭代器，指向第一個元素之前的元素(即反向結尾)向量。

It returns a const_reverse_iterator which is an iterator point to the constant content(vector), the const_reverse_itertator can be increased or decreased just like an iterator but it cannot be used to update/modify the vector content it points to.

它返回const_reverse_iterator ，它是指向常量content(vector)的迭代器，可以像迭代器一樣增加或減少const_reverse_itertator ，但不能用于更新/修改其指向的向量內容。

Note: To use vector, include <vector> header.

注意：要使用向量，請包含<vector>標頭。

Syntax of vector::crend() function

vector :: crend()函數的語法

    vector::crend();

Parameter(s): none – It accepts nothing.

參數： 無 –不接受任何內容。

Return value: const_reverse_iterator – It returns a const reverse iterator pointing to the element preceding the first elements of the vector.

返回值： const_reverse_iterator –它返回一個const反向迭代器，指向向量的第一個元素之前的元素。

Example:

例：

    Input:
vector<int> vector1{ 1, 2, 3, 4, 5 };
Function call:
vector<int>::const_iterator crit;
crit = vector1.crend()-1;
cout<
C++ program to demonstrate example of vector::crend() function
Output
first element is: 10

Reference: C++ vector::crend()



TOP Interview Coding Problems/Challenges
Run-length encoding (find/print frequency of letters in a string) 
Sort an array of 0's, 1's and 2's in linear time complexity 
Checking Anagrams (check whether two string is anagrams or not) 
Relative sorting algorithm 
Finding subarray with given sum 
Find the level in a binary tree with given sum K 
Check whether a Binary Tree is BST (Binary Search Tree) or not 
1[0]1 Pattern Count 
Capitalize first and last letter of each word in a line 
Print vertical sum of a binary tree 
Print Boundary Sum of a Binary Tree 
Reverse a single linked list 
Greedy Strategy to solve major algorithm problems 
Job sequencing problem 
Root to leaf Path Sum 
Exit Point in a Matrix 
Find length of loop in a linked list 
Toppers of Class 
Print All Nodes that don't have Sibling 
Transform to Sum Tree 
Shortest Source to Destination Path 



Comments and Discussions

Ad:
Are you a blogger? Join our Blogging forum.

翻譯自: https://www.includehelp.com/stl/vector-crend-function-with-example.aspx

stl vector 函數