题目
题解
链表删除节点
代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if (!head) {
return head;
}
ListNode* dummyhead=new ListNode(0,head);
ListNode* p=dummyhead;
while(p->next->next){
if(p->next->val==p->next->next->val){
p->next=p->next->next;
}
else{
p=p->next;
}
}
return dummyhead->next;
}
};