比对法,每次找到一个和咱们要设置位置不一样的值
class Solution {
public int removeDuplicates(int[] nums) {
int len = nums.length;
if (len <=1){
return len;
}
//输入: nums = [0,0,1,1,1,2,2,3,3,4]
//输出:5, nums = [0,1,2,3,4]
int currSet=0;
for (int i = 1; i < nums.length; i++) {
if (nums[i]!=nums[currSet]){
currSet++;
nums[currSet]=nums[i];
}
}
return currSet+1;
}
}