题解 | #迭代器遍历容器#
迭代器遍历容器
https://www.nowcoder.com/practice/0f7ab22e60ee4574a9d9c81412b26595
#include <iostream>
// write your code here......
#include <vector>
using namespace std;
// 正序迭代器
void print(vector<int>::const_iterator b, vector<int>::const_iterator e) {
while (b != e) {
cout << *b << " ";
++b;
}
cout << endl;
}
// 重载反序迭代器
void print(vector<int>::const_reverse_iterator b, vector<int>::const_reverse_iterator e) {
while (b != e) {
cout << *b << " ";
++b;
}
cout << endl;
}
int main() {
// write your code here......
vector<int> nums;
int x;
while(cin >> x){
nums.push_back(x);
}
print(nums.cbegin(), nums.cend());
print(nums.crbegin(), nums.crend());
return 0;
}
