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