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
Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.
/**
* 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 newHead = new ListNode(0);
newHead.next = head;
ListNode p = head,q = newHead;
while(p != null) {
if(p.val == val) {
q.next = p.next;
p = q.next;
} else {
q = p;
p = p.next;
}
}
return newHead.next;
}
}
Have you met this question in a real interview?