-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathremove_node.cpp
44 lines (42 loc) · 1013 Bytes
/
remove_node.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
43
44
//program to remove node from linked list
//problem link: https://leetcode.com/problems/remove-linked-list-elements/
/**
* 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) {
if(head==NULL)
{
return head;
}
while(head->val==val)
{
head=head->next;
if(head==NULL)
{
return head;
}
}
ListNode*tmp=head;
while(tmp!=NULL&&tmp->next!=NULL)
{
if(tmp->next->val==val)
{
tmp->next=tmp->next->next;
}
if(tmp->next!=NULL&&tmp->next->val!=val)
{
tmp=tmp->next;
}
}
return head;
}
};