思路:遍历链表,重复的元素只保存最前面的一个。
code:
class Solution {
public:
ListNode *deleteDuplicates(ListNode *head) {
if(head == NULL)return head;
ListNode *h = head, *p;
while(h->next != NULL){
p = h->next;
while(p != NULL && p->val == h->val)
p = p->next;
h->next = p;
h = p;
if(h == NULL)return head;
}
return head;
}
};