Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array nums = [1,1,2]
,
Your function should return length = 2
, with the first two elements of nums being 1
and 2
respectively. It doesn't matter what you leave beyond the new length.
思路:遍历数组,遇到不同的就往前放,直到遍历完,前边放好的就是具备唯一性的数组了。
public class Solution {
public int removeDuplicates(int[] nums) {
if (nums.length == 1) {
return 1;
}
int pValid = 0;
for (int i = 0; i < nums.length - 1; i++) {
while (i < nums.length - 1 && nums[i] == nums[i + 1]) {
i++;
}
nums[pValid++] = nums[i];
}
if (pValid >= 1 && nums[pValid - 1] != nums[nums.length - 1]) {
nums[pValid++] = nums[nums.length - 1];
}
return pValid;
}
}