Tukukkk

Problem: Given a singly linked list of integers l and an integer k, remove all elements from list l that have a value equal to k.

My solution works, but I suspect it's not smart and optimized because I have many extra variables to solve this question.

Node.h:

#ifndef NODE_H_INCLUDED

#define NODE_H_INCLUDED



 template<typename T>

 struct ListNode {

   ListNode(const T &v) : value(v), next(nullptr) {}

   T value;

   ListNode *next;

};



#endif // NODE_H_INCLUDED

main.cpp:

#include<iostream>

#include "Node.h"



void print(ListNode<int> * l){

    while(l != nullptr){

        std::cout << l->value << "n";

        l = l->next;

    }

}



ListNode<int> * removeKFromList(ListNode<int> * l, int k) {

    if(l == nullptr){

        return nullptr;

    }else{

        if(l->value != k){

            ListNode<int> * L2 = new ListNode<int>(l->value);

            ListNode<int> * current = L2;

            l = l->next;

            while(l != nullptr){

                if(l->value != k){

                    ListNode<int> * L3 = new ListNode<int>(l->value);

                    while(current->next != nullptr){

                        current = current->next;

                    }

                    current->next = L3;

                }

                l = l->next;

            }

            return L2;

        }else{

            return removeKFromList(l->next, k);

        }

    }

}



int main(){

    ListNode<int> * L = new ListNode<int>(5);

    ListNode<int> * L1 = new ListNode<int>(6);

    ListNode<int> * L2 = new ListNode<int>(8);

    L1->next = L2;

    L->next = L1;

    print(removeKFromList(L, 7));

    return 0;

}