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.
Subscribe to see which companies asked this question
脑残了=。=居然一开始没想出来怎么做。。。。。。
怎么都记得是以前做过类似的。算法也是之前自己想出来的,就这么忘了。。。忘了。。。忘了。。。一定是我是孙杨迷妹的缘故=。=
加油加油~~
public class Solution {
public int removeDuplicates(int[] nums) {
if(nums == null)
return 0;
int index = 0;
for(int i = 1; i<nums.length; i++ ){
if(nums[index] != nums[i])
nums[++index] = nums[i];
}
return index+1;
}
}