Question

I am using STL list for my linked list implementation but when I am using erase function inside a loop it is giving segmentation fault. Can someone tell me why is it happening?

void remove(list<int> &myList,int N){
    int k = 1;
    list<int>::iterator it;
    for(it = myList.begin(); it != myList.end();it++){
        if(k == N){
            myList.erase(it);
            k = 1;
        }
        else
            k++;
    }
}

Answer 1

When you call erase on an iterator, it invalidates that iterator. But you continue to use it. You need to capture the return value of erase, and assign that back to your iterator, like this:

it = myList.erase(it);

But this will necessitate a slight change in your loop. If you erase, then you don’t want to increment, because then you will be skipping one element. This is especially bad if you end up erasing the last element, because then you will be moving past the end iterator. So, you should only increment if you don’t erase:

for(it = myList.begin(); it != myList.end(); ){
    if(k == N){
        it = myList.erase(it);
        k = 1;
    }
    else
    {
        k++;
        ++it;
    }
}