LC/26.cpp at master · andrea-ramirez/LC · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        set<int> s;
        int size = 0;

        int slow = 0;
        int fast = 0;

        while(fast < nums.size()){
            if(!s.count(nums[slow])){
                s.insert(nums[slow]);
                slow++;
                size++;
                fast++;
            }else{

                while(fast < nums.size() && s.count(nums[fast])){
                    fast++;
                }

                if(fast >= nums.size()){
                    return size;
                }

                int temp = nums[slow];
                nums[slow] = nums[fast];
                nums[fast] = temp;
            }
        }

        return size;

    }
};