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 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.
题目大意:
给定一个数组,确定该数组中有多少个不重复元素,根据测试用例得出,我们需要把前n个不重复元素都“移动”到数组的前n位。
题目代码:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() == 0)
return 0;
int len = nums.size();
int ans = 1;
for(int i=1; i < len; i++){
if(nums[i-1] != nums[i])
nums[ans++] = nums[i];
}
return ans;
}
};