Again and again to find and remove singly linked lists, the smallest value of novice, want to be able to have a little bit more simple code and comments,

CodePudding user response:

To find and remove the minimum value as a function of multiple calls it
Traverse to find the minimum for the first time
The second know the minimum value is few, just delete it
Singly linked lists all the words, will take the next node is minimum, such ability can remove the next node from the current node
Write and post code to correction

CodePudding user response:

Fun

reference 1 floor response:

to find and remove the minimum as a function of multiple calls it
Traverse to find the minimum for the first time
The second know the minimum value is few, just delete it
Singly linked lists all the words, will take the next node is minimum, such ability can remove the next node from the current node
Write and post code to correction

Thank you, I have already written