leetcode---remove-element---数组

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 left = 0;
int right = n - 1;

while(left < right)
{
if(A[left] == elem)
{
while(A[right] == elem && left < right)
{
--right;
}
swap(A[left], A[right]);
}
++left;
}

int cnt = 0;
for(int i=0; i<n; i++)
if(A[i] != elem)
++cnt;
return cnt;
}
};