在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead)
{
if( pHead == NULL || pHead->next == NULL ) return pHead;
else {
ListNode* head = new ListNode(0);
head->next = pHead;
ListNode* preNode = head;
ListNode* curNode = pHead;
while( curNode->next != NULL ) {
ListNode* nextNode = curNode->next;
if( curNode->val == nextNode->val ) {
while( nextNode->next != NULL && nextNode->val == nextNode->next->val ) {
nextNode = nextNode->next;
}
preNode->next = nextNode->next;
if( preNode->next != NULL ) {//nextNode不是最后一个节点,更新
curNode = preNode->next;
}
else {
return head->next;
}
}else {
preNode = preNode->next;
curNode = curNode->next;
}
}
return head->next;
}
}
};