题目:
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.
分析:
在排好序的数组里,删除重复的元素。
思路:
不能再申请空间,同时,返回新的数组的长度,原数组后面的玩意木有关系。思路看代码,特别简单。
代码:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int i =0;
int j =1;
int len = nums.size();
if(len == 0 || len == 1)
{
return len;
}
int val = nums[0];
for(i =1; i<len; i++)
{
if(nums[i] != val)
{
val = nums[i];
nums[j] = nums[i];
j ++;
}
}
return j;
}
};
简单一点的代码:
int count = 0;
for(int i = 1; i < n; i++){
if(A[i] == A[i-1]) count++;
else A[i-count] = A[i];
}
return n-count;