Problems : 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]
.
1.C++版
class Solution {
public:
int removeDuplicates(int A[], int n) {
if(n < 2){
return n;
}
int sameElemCount = 0;
for(int i = 1;i < n;++i){
if(A[i-1] == A[i]){
++sameElemCount;
}else{
A[i-sameElemCount] = A[i];
}
}
return n - sameElemCount;
}
};
2.Java版
public class Solution {
public int removeDuplicates(int[] A) {
int length = A.length;
if(A.length < 2){
return A.length;
}
int sameElemCount = 0;
for(int i = 1;i < A.length;++i){
if(A[i-1] == A[i]){
++sameElemCount;
}else{
A[i-sameElemCount] = A[i];
}
}
return length - sameElemCount;
}
}
3.Python版
待续
完