class Solution {
    
    
    public int removeDuplicates(int[] nums) {
       int i=0,counter=0;
        while(i<nums.length){
            if(i==nums.length-1)
                nums[i]=nums[nums.length-1];
          else 
              if(nums[i]==nums[i+1])
            {
                 nums[i]='*';
            }
            i++;
        }
        
        
                for(i=0;i<nums.length;i++)
        {   if(nums[i]!='*')
            { nums[counter]=nums[i];
              counter++;}
                      
        }
        
      
        
        return (counter);
        
    }
}