public int removeDuplicates(int[] nums) {
int i=0,k=0,j=0,b=0,a=0;
if(nums==null){
return i;
}else{
a =nums.length;
while(i<a){
j=i+1;
while(j+1<a){
if(nums[i]<nums[j]){
break;
}
else if(nums[i]==nums[j+1]){
b=i;
while(b+1<a){
nums[b]=nums[b+1];
b++;
}
a--;
}else{
break;
}
}
i++;
}
}
return a;
}