leetcode - 26 Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array

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 thisin 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'tmatter what you leave beyond the new length.

Subscribe tosee which companies asked this question

 

给定一个数组，删除掉重复的元素，最后返回剩余元素的个数。

 

直接利用vector里面的erase函数就可以删除

详见

http://www.cplusplus.com/reference/vector/vector/erase/

所以，就有了如下代码，算法思想比较清晰，不断地删除和选定元素相同的元素，最后直接返回数组的长度。

 

int removeDuplicates(vector<int>& nums) {

if(nums.size()<2)return nums.size();
int i,j;

for(int i = 0 ; i < nums.size() ; i++){
j = i + 1;
while(j < nums.size() && nums[j] == nums[i]){
nums.erase(nums.begin() + j);
}
}
return nums.size();
}