class Solution {
public:
int removeElement(int A[], int n, int elem) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int len = 0;
for (int i = 0; i < n; ++i)
{
if (A[i] != elem)
A[len++] = A[i];
}
return len;
}
};
second time
class Solution {
public:
int removeElement(int A[], int n, int elem) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int curIdx = 0;
for(int i = 0; i < n; ++i)
{
if(A[i] != elem) A[curIdx++] = A[i];
}
return curIdx;
}
};