c++中cend end_vector :: cend（）函数以及C ++ STL中的示例

c++中cend end

C ++ vector :: cend()函数 (C++ vector::cend() function)

vector::cend() is a library function of "vector" header, it can be used to get the last element of a vector. It returns a const iterator pointing to the past-the-end element of the vector.

vector :: cend()是“ vector”头文件的库函数，可用于获取矢量的最后一个元素。它返回一个指向向量的past-the-end元素的const迭代器。

It returns a const_iterator which is an iterator point to the constant content(vector), the const_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_iterator ，它是指向常量content(vector)的迭代器， const_itertator可以像迭代器一样增加或减少，但不能用于更新/修改其指向的向量内容。

Note:

注意：

To use vector, include <vector> header.
要使用vector，请包含<vector>标头。
It does not point to the last element, thus to get the last element we can use vector::cend()-1.
它不指向最后一个元素，因此要获取最后一个元素，我们可以使用vector :: cend()-1 。

Syntax of vector::cend() function

vector :: cend()函数的语法

    vector::cend();

Parameter(s): none – It accepts nothing.

参数： 无 –不接受任何内容。

Return value: const_iterator – It returns a const iterator pointing to the past-the-end element of the vector.

返回值： const_iterator –它返回指向向量的过去元素的const迭代器。

Example:

例：

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

Reference: C++ vector::cend()



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.