Leetcode 26. & 83. Remove Duplicates from Sorted Array/List 有序数组去重，快慢指针，链表注意清空后面不要的元素

26 Array

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size()==0) return 0;
        int slow=0, fast = 1;
        while(fast<nums.size()){
            if(nums[fast]!=nums[slow]){
                nums[++slow]=nums[fast];
            }
            fast++;
        }
        return slow+1;
    }
};

83 LinkedList

/**
 * 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) return head;
        ListNode* slow = head;
        ListNode* fast = slow->next;
        while(fast!=nullptr){
            if(fast->val != slow->val){
                slow->next = fast;
                slow = slow->next;
            }
            fast=fast->next;
        }
        slow->next = nullptr; // 这里清空很关键，不然把后面的元素也会带出来
        return head;
    }
};