C ++列表迭代器算法

Question

我知道您不能以“ it + n”的形式使用帶列表的迭代器，但是為什么當我使用++ it時程序可以編譯，即：

//program compiles
list<int> v {1,2,3,4}; 
auto begin = v.begin(),
end = v.end(); 
while (begin != end) {
    ++begin;  
    begin = v.insert(begin, 42); 
    ++begin;  // advance begin past the element we just added
}

//program doesn't compile
list<int> v{1,2,3,4}; 
auto begin = v.begin(),
end = v.end(); 
while (begin != end) {
    begin+=1; //or alternatively begin = begin +1 
    begin = v.insert(begin, 42);  // insert the new value
    ++begin;  // advance begin past the element we just added
}

Answer 1

根據standart std :: list實現的雙向迭代器http://www.cplusplus.com/reference/iterator/BidirectionalIterator/沒有“ + =”運算符