LeetCode 203

Remove Linked List Elements

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

 /**
  * Definition for singly-linked list.
  * public class ListNode {
  *     int val;
  *     ListNode next;
  *     ListNode(int x) { val = x; }
  * }
  */
 public class Solution {
     public ListNode removeElements(ListNode head, int val) {

         ListNode fakehead = new ListNode(-1);
         fakehead.next = head;
         ListNode n = fakehead;

         if(head == null){
             return head;
         }
         while(n.next != null){
             if(n.next.val == val){
                 n.next = n.next.next;
             }else{
                 n = n.next;
             }
         }
         return fakehead.next;
     }
 }