/**
* 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 = new ListNode(0);
dummy->next = head;
ListNode* prev = dummy;
while(prev->next != nullptr)
{
if(prev->next->val == val)
{
prev->next = prev->next->next;
}
else
{
prev = prev->next;
}
}
return dummy->next;
}
};
leetcode | 203题 | 移除链表元素
最新推荐文章于 2022-08-10 16:59:45 发布