rend函数
语法:
1 2 |
reverse_iterator rend(); const_reverse_iterator rend() const; |
rend() 返回Vector起始的逆迭代器
源代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
/** * Returns a read/write reverse iterator that points to one * before the first element in the %vector. Iteration is done * in reverse element order. */ reverse_iterator rend() { return reverse_iterator(begin()); } /** * Returns a read-only (constant) reverse iterator that points * to one before the first element in the %vector. Iteration * is done in reverse element order. */ const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } |
测试代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
// 梁笔记 // https://zouzhongliang.com #include <iostream> #include <vector> using namespace std; int main() { vector<int> v1; vector<int> v2(3, 2); v1.push_back(1); v1.push_back(2); v1.push_back(3); v1.push_back(4); v1.push_back(5); //顺序输出 vector<int>::iterator it = v1.begin(); for(it;it!=v1.end();it++) cout<<*it<<","; cout<<endl; //倒序输出 vector<int>::reverse_iterator it1 = v1.rbegin(); for(it1;it1!=v1.rend();it1++) cout<<*it1<<","; cout<<endl; } |
测试结果:
1 2 |
1,2,3,4,5, 5,4,3,2,1, |