题目描述:
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(A == NULL || n <= 0)
{
return 0;
}
int i = 0;
for(int j = 1; j < n; ++j)
{
if(i + 1 < n && A[j] != A[i])
{
A[++i] = A[j];
}
}
return i+1;/*返回的数组长度应该为最后一个元素的下标加1*/
}
};
分析:
时间复杂度 O(n)
空间复杂度O(1)