解法1
双指针,一个指针从左向右滑动,另一个指针放不重复的元素
class Solution {
public int removeDuplicates(int[] nums) {
int pre = nums[0], k = 1;
for (int j = 1; j < nums.length; j++) {
if (nums[j] != pre) {
nums[k++] = nums[j];
pre = nums[j];
}
}
return k;
}
}