class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode *mark=head;
if(mark==nullptr||mark->next==nullptr)
{
return mark;
}
while(head->next!=nullptr)
{
if(head->val==head->next->val)
{
head->next=head->next->next;
}
else
{
head=head->next;
}
}
return mark;
}
};
答案解法类似
加油!