Leetcode26，83题解

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.empty()){
            return 0;
        }
        int fast = 0;
        int slow = 0;
        for (int i=0;i<nums.size()-1;i++) {
            if (nums.at(fast) != nums.at(fast+1)) {
                nums[slow] = nums.at(fast);
                slow++;
            }
            fast++;
        }
        nums[slow] = nums.back();
        slow++;
        return slow;
    }
};

class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if (head == nullptr) {
            return nullptr;
        }
        ListNode* slow = head;
        ListNode* fast = head;
        while (fast != nullptr) {
            if (fast->val != slow->val) {
                slow->next = fast;
                slow = fast;
            }
            fast = fast->next;
        }
        slow->next = nullptr;// 断开后续的重复节点
        return head;
    }
};