class Solution {public:    int removeDuplicates(int A[], int n) {         int temp = A[0],j = 0,count;        for(int i = 0 ; i < n ;){            count = 0;            while(i
     
      =2) A[j++] = temp;            A[j++] = temp;            temp = A[i];        }        return j;    }};