class Solution {
public int removeDuplicates(int[] nums) {
int len = 0;
for (int i = 0, j = 0; j < nums.length - 1; j++) {
if (nums[i] != nums[j + 1]) {
nums[i + 1] = nums[j + 1];
i++;
}
len = i;
}
return len + 1;
}
}
原文链接 : https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/