使用迭代器反向输出vector数组出现异常结果求助

Hey there! Let's break down why your reverse iteration using iterator arithmetic is causing exceptions, and walk through the right ways to fix it.

First, let's assume your attempted reverse loop looked something like this (since your code snippet cut off):

// Common incorrect approach that triggers undefined behavior
for (vector<int>::iterator it = arr.begin() + arr.size() - 1; it >= arr.begin(); --it) {
    cout << *it << " ";
}

What's Going Wrong? #

The problem here is that when it reaches arr.begin(), the next --it will move the iterator to a position before the start of the vector. Accessing or even decrementing past begin() is undefined behavior—this is exactly why you're seeing weird exceptions or garbage output.

Correct Ways to Reverse Iterate a Vector #

1. Use Reverse Iterators (Recommended!)

Vector provides built-in reverse iterators that handle all boundary logic for you. This is the cleanest and safest approach:

#include <iostream>
#include <vector>
using namespace std;

int main(){
    vector<int> arr;
    arr.push_back(1);
    arr.push_back(2);
    arr.push_back(3);
    arr.push_back(4);

    // Your original working forward iterator loop
    cout << "Forward output: ";
    for (vector<int>::iterator it = arr.begin(); it != arr.end(); ++it) {
        cout << *it << " ";
    }
    cout << endl;

    // Clean reverse iteration with reverse iterators
    cout << "Reverse output: ";
    for (vector<int>::reverse_iterator it = arr.rbegin(); it != arr.rend(); ++it) {
        cout << *it << " ";
    }
    cout << endl;

    return 0;
}

• rbegin() points directly to the last element of the vector
• rend() points to the position right before the first element
• Incrementing a reverse iterator (++it) moves it toward the start of the vector—perfect for reverse traversal!

2. Iterator Arithmetic Done Safely

If you really want to use regular iterators with pointer-like arithmetic, adjust your loop to stop before you decrement past begin():

cout << "Reverse (safe arithmetic): ";
vector<int>::iterator it = arr.end() - 1;
while (true) {
    cout << *it << " ";
    if (it == arr.begin()) break;
    --it;
}
cout << endl;

This way, you never let the iterator cross the start boundary of the vector.

3. Index-Based Access (Simpler for Arithmetic)

Since vectors support random access, you can also use indexes to mimic pointer arithmetic—this is often easier to read:

cout << "Reverse (index-based): ";
for (int i = arr.size() - 1; i >= 0; --i) {
    cout << arr[i] << " ";
    // Or with iterators: cout << *(arr.begin() + i) << " ";
}
cout << endl;

Key Takeaway #

Always avoid iterating past the bounds of your container—whether that's before begin() or after end(). Reverse iterators are designed specifically for this use case, so they're your best bet for clean, bug-free code.

内容的提问来源于stack exchange，提问作者John Tedesco