1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int count = 0;
        int now = A[0];
        for(int i = 1; i < n-count; i++) {
            if(now == A[i]) {
                for(int j = i+1; j < n-count; j++) {
                    int tmp = A[j];
                    A[j] = A[j-1];
                    A[j-1] = tmp;
                }
                count++;
                i--;
            } else {
                now = A[i];
            }
        }
        return n - count;
    }
};