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 A = [1,1,2],
Your function should return length = 2, and A is now [1,2].
借鉴之前删除数组中的元素的算法,就可以很快写出这个题目了
class Solution {
public:
int removeDuplicates(int A[], int n) {
if(n==0)return 0;
if(n==1)return 1;
int answer=n;
int start=1;
for(int i=1;i<n;i++)
{
if(A[i]==A[i-1])
{
answer--;
}
else
{
A[start++]=A[i];
}
}
return answer;
}
};