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.
这里不仅要返回新的长度,还要把原数组当中elem的元素都删除才行。
class Solution {
public:
int removeElement(int A[], int n, int elem) {
for (int i = 0; i < n; i++)
{
if (A[i] == elem )
{
for(int j = i; j < n-1; j++)
{
A[j] = A[j+1];
}
n--;
i--;
}
}
return n;
}
};