removing all instances of a certain integer from a linked lis

[bkoper16]

Im doing a project and i cant figure out how to remove all the instances for a certain integer from a linked list(The list can only be trans-versed once)

can some post an example how to do this

[Azagaros]

Let us assume something like this:

class LinkListNode
{
public:
        int numberStored;
        LinkListNode* nextNode;
        LinkListNode() 
        {
             numberStored = 0;
             nextNode = NULL;
        }
};

void Delete(int searchNumber)
{
        LinkListNode* prevNode = listTop;
        LinkListNode* currentNode = listTop;

        while(currentNode != NULL)
        {
               if(currentNode->numberStored == searchNumber)
               {
                    if(currentNode == listTop)
                    {
                           listTop = currentNode->nextNode;
                    }
                    else
                    {
                           prevNode->nextNode = currentNode->nextNode;
                    }
                    delete currentNode;
   
               }
               
               prevNode = currentNode;
               currentNode = currentNode->nextNode;
         } // end the while
} // end function. 

[bkoper16]

this only deletes the first instance
i want to delete all instances
such as a list: 2, 7,3,5,3,3
if 3 is selected to be removed becomes
2,7,5

[Azagaros]

sorry i Missed my own logic, it has been a while since I did this:

void Delete(int searchNumber)
{
        LinkListNode* prevNode = listTop;
        LinkListNode* currentNode = listTop;

        while(currentNode != NULL)
        {
               if(currentNode->numberStored == searchNumber)
               {
                    if(currentNode == listTop)
                    {
                           listTop = currentNode->nextNode;
                           delete currentNode;
                           prevNode = listTop;
                           currentNode = listTop->nextNode;
                    }
                    else
                    {
                           prevNode->nextNode = currentNode->nextNode;
                           delete currentNode;
                           currentNode = prevNode->nextNode;
                    }
   
               }
               else
               {
                       prevNode = currentNode;
                       currentNode = currentNode->nextNode;
               }
         } // end the while
}

Again I apologize for my missed step it has been a while since I had to figure that out.

[D80DSL3A]

Closer, but still not quite right - I think.
Consider a list where the # to be removed appears twice (or more) at the beginning of the list.
eg. 3,3,5,7,3,9 where the 3's are to be removed. I think the 2nd 3 will be missed.
Line 15 causes the new listTop to be skipped after the first deletion.

[bkoper16]

thanks ill see how this revision works and let you know if it does it right
thanks for the help so far

[Azagaros]

Line 15 would become:

currentNode = listTop; // this would fix the problem 

I am sorry I am doing this off the cuff and not testing the code.