题目:
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;
int length = 1;
for(int i = 1; i < n; i++) {
if(A[i] != A[length-1]) {
A[length] = A[i];
length++;
}
}
return length;
}
};
本文介绍了一个C++程序,用于在不使用额外空间的情况下从已排序数组中移除重复元素,并返回处理后的数组长度。该算法确保每个元素仅出现一次。
1070

被折叠的 条评论
为什么被折叠?



