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

Solution 1: easy linked list problem.

 public class Solution {  
   public ListNode removeElements(ListNode head, int val) {  
     ListNode dummy=new ListNode(0);  
     dummy.next=head;  
     ListNode p=dummy;  
     while (p.next!=null) {  
       if (p.next.val==val) p.next=p.next.next;  
       else p=p.next;  
     }  
     return dummy.next;  
   }  
 }