-
Notifications
You must be signed in to change notification settings - Fork 0
/
203-remove-linked-list-elements.cpp
42 lines (41 loc) · 1.08 KB
/
203-remove-linked-list-elements.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
* 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* dummy=new ListNode(0, head); //dummy
// ListNode* curr=head;
// ListNode* prev=dummy;
// while(curr){
// if(curr->val==val)
// prev->next=curr->next;
// else prev=curr;
// curr=curr->next;
// }
// return dummy->next;
// }
// };
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(!head)
return nullptr;
ListNode* curr=head;
ListNode* prev=head;
while(curr){
if(curr->val==val)
prev->next=curr->next;
else prev=curr;
curr=curr->next;
}
return head->val==val?head->next:head;
}
};