LeetCode Oj 203. Remove Linked List Elements

203. Remove Linked List Elements

 

Question Editorial Solution

  My Submissions

• Total Accepted: 71251
• Total Submissions: 241722
• Difficulty: Easy

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview? 

Yes

 

No

Discuss Pick One

class Solution {
public:
       ListNode* removeElements(ListNode* head, int val) {
       if(head==NULL) return head;
       if(head->val!=val)
       {
           head->next=removeElements(head->next,val);
           return head;
       }
       else
         return removeElements(head->next,val);
    }
};