-
Notifications
You must be signed in to change notification settings - Fork 0
/
remove_dups.cpp
40 lines (38 loc) · 986 Bytes
/
remove_dups.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
#include <vector>
#include <string>
#include <map>
using namespace std;
/**
* 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* deleteDuplicates(ListNode* head) {
if(head==NULL || head->next == NULL){
return head;
}
ListNode* currNode = head->next;
ListNode* prevNode = head;
// int elem = head->val;
while(currNode!=NULL){
if(currNode->val==prevNode->val){
currNode = currNode->next;
}
else{
prevNode->next = currNode;
prevNode = currNode;
currNode = currNode->next;
}
}
prevNode->next = currNode;
prevNode = currNode;
return head;
}
};