用到了双指针的思想
class Solution {
public int removeDuplicates(int[] nums) {
int j = 0;
for (int i = 0; i < nums.length-1; i++) {
if (nums[i] != nums[i+1]) {
nums[++j] = nums[i+1];
}
}
return ++j;
}
}
用到了双指针的思想
class Solution {
public int removeDuplicates(int[] nums) {
int j = 0;
for (int i = 0; i < nums.length-1; i++) {
if (nums[i] != nums[i+1]) {
nums[++j] = nums[i+1];
}
}
return ++j;
}
}