83. 删除排序链表中的重复元素 - 力扣(LeetCode) 如果重复就cur->next=cur->next->next; 否则就cur=cur->next;
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if(head==NULL||head->next==NULL)return head;
ListNode* cur=head;
while(cur&&cur->next)
{
if(cur->val==cur->next->val)
{
cur->next=cur->next->next;
}
else
{
cur=cur->next;
}
}
return head;
}
};