比如 这道题（据说很简单）
Given an array and a value, remove all instances of that > value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length. 以下是答案。
class Solution {
public:
int removeElement(int A[], int n, int elem) {
int i = 0;
int j = 0;
for(i = 0; i < n; i++) {
if(A[i] == elem) {
continue;
}
A[j] = A[i];
j++;
}
return j;
}
};
我不明白为什么要加 A[j] = A[i]; 这行代码。 真心请教怎么入门。。
1
Select Language