要求:如题
思路
法一:两个一样则前指向后的后,否则移动一格
/**
* 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==nullptr||head->next==nullptr)return head;
ListNode* p=head;
while(p->next){
if(p->val==p->next->val)
p->next=p->next->next;
else p=p->next;
}
return head;
}
};
法二:递归,前后相同返回后一个
/**
* 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==nullptr||head->next==nullptr)return head;
ListNode *headnext=deleteDuplicates(head->next);
if(head->val==headnext->val)return headnext;
else head->next=headnext;
return head;
}
};