题目描述
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:
//count记录不重复元素的个数
int removeDuplicates(int A[], int n) {
if(A==NULL||n<=1)
return n;
int count=1;
for(int i=1;i<n;i++){
if(A[i]!=A[i-1]){
A[count++]=A[i];//函数中数组作为指针使用,当A[1]=A[2]时,
} // 表明数组第二个数指向原数组的第三个数的内存,所以此时A为[1,2]
}
return count;
}
};