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) {
int index = 1;
if(!n) {
return 0;
}
for(int i=1;i<n;i++)
{
if(A[i]!=A[i-1])
{
A[index]=A[i];
index++;
}
}
return index;
}
};