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
链表操作的题目,一般在链表中,对头结点的边界操作,是在前面再加一个头结点prev,结束后将prev=NULL;
下面这个解法很简洁:
/**
* 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) {
ListNode dummy(0);
ListNode *prev = &dummy;
while(head)
{
if(head->val != val)
{
prev->next = head;
prev = head;
}
head = head->next;
}
prev->next = NULL; //pay attention here
return dummy.next;
}
};