class Solution {
public int removeDuplicates(int[] nums) {
if (nums.length<2)
return nums.length;
int i=0;
int j=1;
for ( i=0 ,j=1;j< nums.length;j++){
if (nums[i]!=nums[j]){
nums[++i]=nums[j];
}
}
return i+1;
}}
