-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path83.RemoveElementFromSorted_Linklist.cpp
More file actions
37 lines (28 loc) · 1.02 KB
/
83.RemoveElementFromSorted_Linklist.cpp
File metadata and controls
37 lines (28 loc) · 1.02 KB
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
/* * 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) {}
* };
*/
//https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/
/*
next is a pointer so we can access the next element through the next and alter the
current position of next */
//###############################################################################
// remove duplicate elements from sorted linklist
//#################################################################################
ListNode* deleteDuplicates(ListNode* head) {
ListNode *hold=head;
while(hold!=NULL && hold->next!=NULL){
if(hold->val==hold->next->val){
hold->next=hold->next->next;
}
else{
hold=hold->next;
}
}
return head;
}