题目:
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
分析:考虑多种情况,只有一个节点,前面的节点等于val的情况。
/**
* 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) {
if(head==NULL)
return NULL;
ListNode* temp;
while((head->val==val))
{
if(head->next!=NULL)
head=head->next;
else
return NULL;
}
temp=head;
while(temp&&temp->next)
{
if((temp->next->val)==val)
{
temp->next=temp->next->next;
continue;
}
if(temp->next==NULL)
{
temp=NULL;
}
else
{
temp=temp->next;
}
}
return head;
}
};