26. 删除排序数组中的重复项
class Solution {
public int removeDuplicates(int[] nums) {
if (nums == null)
return -1;
if (nums.length <= 1)
return nums.length;
int left = 1;
int right = 1;
for (right = 1; right < nums.length; right++) {
if (nums[right] != nums[right - 1]) {
nums[left] = nums[right];
++left;
}
else {
continue;
}
}
return left;
}
}