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. go through linked list, compare value and remvoe
2.need to save head node
public ListNode removeElements(ListNode head, int val) {
ListNode newHead = new ListNode(0);
newHead.next = head;
ListNode p1 = newHead;
ListNode p2 = head;
while(p2!=null){
if(p2.val == val){
p1.next = p2.next;
p2 = p2.next;
continue;
}
p2 = p2.next;
p1 = p1.next;
}
return newHead.next;
}