Remove Linked List Elements - LeetCode 203

 Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.

 

Example 1:

Input: head = [1,2,6,3,4,5,6], val = 6
Output: [1,2,3,4,5]

Example 2:

Input: head = [], val = 1
Output: []

Example 3:

Input: head = [7,7,7,7], val = 7
Output: []

 

Solution(Only function):

class Solution {

    public ListNode removeElements(ListNode head, int val) {

        if(head==null)

            return null;           

        while(head!=null && head.val==val)//checking if head is the val

        {

            head=head.next;

        }       

        ListNode curr=head;

        while(curr!=null && curr.next!=null) 

        {

            if(curr.next.val==val)

            {

                curr.next=curr.next.next;

            }else

            {

                curr=curr.next;

            }

        }

        return head;

    }

}