我正在做一个练习,我有一个向量,我正在编写自己的反向算法,使用反向和正常(正向)迭代器来反转向量的内容.但是,我无法比较迭代器.
I am working on an exercise where I have a vector and I am writing my own reverse algorithm by using a reverse and a normal (forward) iterator to reverse the content of the vector. However, I am not able to compare the iterators.
int vals[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 };
vector<int> numbers(vals, vals + 10);
vector<int>::iterator start = numbers.begin();
vector<int>::reverse_iterator end = numbers.rend();
我之前有一个使用两个迭代器来反转向量的算法,但是在这个任务中,我无法使用它们之间的 != 运算符来比较它们.我的猜测是获取向量中的底层指针或索引,但如何获取指针/索引?
I have a previous algorithm for reversing the vector by using two iterators, however in this task I am not able to compare them using the != operator between them. My guess would be to get the underlying pointers or indexes in the vector with each other but how do I get the pointers/index?
使用 base()
: it == rit.base() - 1
.
这篇关于比较 vector<T>::iterator 和 vector<T>::reverse_iterator的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持html5模板网!