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.
题目主要意思:给你一个有序数组,让你将有序数组中的重复的数去掉使每个数只有一个,然后返回这个数组有多少个不同的数,以及将这些不同的数按顺序排列在前面。要求是不能使用额外内存。例如,nums=[1,1,2] 应该返回的值是2,但注意要使nums的前两位变成nums=[1,2]第三位不用考虑是多少
public static int removeDuplicates(int[] nums){
int len = nums.length;
if(nums == null || len == 0){
return 0;
}
int count = 1;
int j = 0;
for(int i = 1 ; i < len ;i++){
if(nums[j] != nums[i]){
nums[count] = nums[i];
j = i;
count++;
}
}
return count;
}
第一遍提交时一直出错,最后才了解到要注意最终nums也变化了