提交记录
执行结果:
解题思路:
p指针用来遍历,s指针用来临时存放;
语言:C++
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(head==NULL) return NULL;
ListNode*H = new ListNode(-1);
H->next = head;
ListNode*p = H;
ListNode*s =NULL;
while(p->next!=NULL)
{
if(p->next->val==val)
{
s= p->next;
p->next = p->next->next;
delete s;
}else
p = p->next;
}
return H->next;
}
};
细节提升
1.申请空的头指针
ListNode*H = new ListNode(-1);
H->next = head;