力扣 83. 删除排序链表中的重复元素

给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。

示例 1:

输入: 1->1->2
输出: 1->2
示例 2:

输入: 1->1->2->3->3
输出: 1->2->3

1.快慢指针

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if(head==NULL||head->next==NULL){
            return head;
        }
        ListNode* fast=head;
        ListNode* slow=head;
        while(fast){
            if(fast->val!=slow->val){
                slow->next=fast;
                slow=fast;
            }
            else{
                fast=fast->next;
            }
        }
        slow->next=NULL;
        return head;
    }
};

2.递归

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if(head==NULL||head->next==NULL){
            return head;
        }
        if(head->val==head->next->val){
            head=deleteDuplicates(head->next);
        }
        else{
            head->next=deleteDuplicates(head->next);
        }
        return head;
    }
};