问题描述:
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->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) {
if(head==NULL || head->next==NULL) return head;//
ListNode* prehead = new ListNode(0);
prehead->next = head;//前置头结点!!!
ListNode* pre = prehead;
ListNode* cur = head;
while(cur->next)//
{
if(cur->val == cur->next->val)
{
pre->next = cur->next;
}
else
{
pre = pre->next;
}
cur = cur->next;
}
return prehead->next;
}
};