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
题意：删除链表中指定值的结点。

思路：遍历删除。

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
while(head && head->val==val){
head = head->next;
}
ListNode* p = head;
while(p && p->next){
if(p->next->val == val){
p->next = p->next->next;
}else{
p = p->next;
}
}
return head;
}
};