Leetcode 203. Remove Linked List Elements (Easy) (cpp)
Tag: Linked List
Difficulty: Easy
/*
203. Remove Linked List Elements (Easy)
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
*/
/**
* 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(-1), *p = dummy;
dummy -> next = head;
while (p != NULL) {
if (p -> next != NULL && p -> next -> val == val) {
p -> next = p -> next -> next;
} else {
p = p -> next;
}
}
return dummy -> next;
}
};