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.
Subscribe to see which companies asked this question
思路：
链表的题只要在原链表中加一个“伪”头结点，一切都变得简单了。
java code:
/**
* 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 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;
}
}LeetCode:Remove Linked List Elements
原文：http://blog.csdn.net/itismelzp/article/details/51588208