生成一个指向链表第一个节点的头节点,避免单独处理。注意对指针的手动释放。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* first = new ListNode(0);
first->next = head;
ListNode* ptr = first;
while (ptr->next != nullptr) {
if (ptr->next->val == val) {
ListNode* tmp = ptr->next;
ptr->next = tmp->next;
delete tmp;
} else {
ptr = ptr->next;
}
}
head = first->next;
delete first;
return head;
}
};