问题: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;
}
};