版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://cloud.tencent.com/developer/article/1433669
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
/**
* 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) {
return nullptr;
}
ListNode* start = new ListNode(0);
start->next = head;
ListNode* pre = start;
ListNode* current = head;
while(current) {
if(current->val == val) {
pre->next = current->next;
}
else {
pre = pre->next;
}
current = current->next;
}
return start->next;
}
};
/**
* 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) {
return nullptr;
}
head->next = removeElements(head->next, val);
if(head->val == val) {
return head->next;
}
return head;
}
};