class Solution {
public int removeDuplicates(int[] nums) {
int i = 0; // record put unique element
int j = 0;
while(j < nums.length){
if(i == 0 || nums[i-1] != nums[j]){
nums[i] = nums[j];
i++;
j++;
}else{
j++;
}
}
return i;
}
}
{{ message }}
