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.
solution: 同22题类似吧,都是简单题,一个循环搞定
class Solution {
public:
int removeElement(int A[], int n, int elem) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(A == NULL||n <= 0)
return n;
int idx = 0;
int ridx = 0;
for(idx; idx < n; idx++)
{
if( A[ idx ] != elem )
{
A[ ridx ] = A[ idx ];
ridx ++;
}
}
return ridx;
}
};