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

AC:

/**  * 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 newnode = new ListNode(0);          newnode.next = head;          ListNode p = newnode;          ListNode q = head;          while(q!=null) {              if(q.val == val) {                  p.next = q.next;              } else {                  p = p.next;              }              q = q.next;          }                    return newnode.next;      }  }