题目:在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5。
代码如下:
<pre name="code" class="cpp" style="color: rgb(51, 51, 51); font-size: 14px; line-height: 22.4px;">struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead)
{
if(pHead == NULL)
return NULL;
ListNode *pre = new ListNode(0);
ListNode *slow = pre;
slow->next = pHead;
ListNode *fast = slow->next;
bool sign = false;
ListNode *temp = NULL;
while(fast != NULL && fast->next != NULL)
{
if(fast->val == fast->next->val)
{
temp = fast->next;
delete fast;
fast = NULL;
fast = temp;
sign = true;
}
else
{
if(sign)
{
slow->next = fast->next;
fast = fast->next;
sign = false;
}
else
{
slow = fast;
fast = slow->next;
}
}
}
if(fast->next == NULL)
{
if(sign)
slow->next = fast->next;
else
slow->next = fast;
}
return pre->next;
}
};