Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void delete_double (LN<T>*& l) {
- if (l == nullptr)
- return;
- LN<T> *p = l;
- while ( p -> next != nullptr && p -> next -> next != nullptr)
- {
- if (p -> value == p -> next -> value) // the current value is equal to the next value in the linked list
- {
- if (p == l) // when the first two values are the same // not sure if it is correct
- {
- l = l -> next -> next;
- }
- else // Problem should be here
- {
- LN<T> *to_delete = p; // Also tried this (doesn't work)
- p = p->next;
- delete to_delete; // LN<T>* to_delete = p;
- // LN<T>* to_delete2 = p -> next;
- LN<T> *to_delete1 = p; // l = to_delete2 -> next;
- p = p->next; // delete to_delete;
- delete to_delete1; // delete to_delete2;
- }
- }
- else
- {
- p = p-> next;
- }
- }
- }
Add Comment
Please, Sign In to add comment