Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.
Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length = 5
, with the first five elements of nums
being modified to 0
, 1
, 2
, 3
, and 4
respectively. It doesn't matter what values are set beyond the returned length.
方法一、
class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length==0)
return 0;
int curVal=nums[0];
int rvIndex=1;
int count=1;
for(int i=0;i<nums.length;i++){
if(curVal!=nums[i]){
curVal=nums[i];
count++;
swap(nums,rvIndex++,i);
}
}
return count;
}
private void swap(int[]nums,int l,int r){
if(nums[l]==nums[r])
return;
int temp=nums[l];
nums[l]=nums[r];
nums[r]=temp;
}
}
方法二:
class Solution {
public int removeDuplicates(int[] nums) {
int curVal=-1;
int rvIndex=1;
int count=-1;
if(nums.length==0)
return 0;
for(int i=1;i<nums.length;i++){
if(curVal!=nums[i]){
curVal=nums[i];
count++;
swap(nums,rvIndex++,i);
}
}
return count;
}
private void swap(int[]nums,int l,int r){
if(nums[l]==nums[r])
return;
int temp=nums[l];
nums[l]=nums[r];
nums[r]=temp;
}
}
方法三:
class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length==0)
return 0;
int j=0;
for(int i=1;i<nums.length;i++){
if(nums[i]!=nums[j]){
nums[++j]=nums[i];
}
}
return j+1;
}
}