Remove Duplicates from Sorted List II

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,

Given 1->2->3->3->4->4->5, return 1->2->5.

Given 1->1->1->2->3, return 2->3.

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode * pResultHead = NULL;
ListNode * pResultCur = NULL;
if(!head){
return NULL;
}
ListNode * pCur = head;
int nCurVal = pCur->val;
int nSameCount = 1;
while(pCur->next){
if(pCur->next->val != nCurVal){
if(nSameCount == 1){
if(pResultCur == NULL){
pResultCur = pCur;
pResultHead = pResultCur;
}else{
pResultCur->next = pCur;
pResultCur = pResultCur->next;
}
}else{
nSameCount = 1;
}
}else{
nSameCount++;
}
pCur = pCur->next;
nCurVal = pCur->val;
}
if(nSameCount == 1){
if(pResultCur == NULL){
pResultCur = pCur;
pResultHead = pResultCur;
}else{
pResultCur->next = pCur;
}
}else{
if(pResultCur == NULL){
pResultHead = pResultCur;
}else{
pResultCur->next = NULL;
}
}
return pResultHead;
}
};