LeetCode:Remove Element

 1 class Solution{
 2 public:
 3     int removeElement(int A[],int n, int elem){
 4         int i=0,j=0;
 5         if(n<=0)
 6         {
 7             return n;
 8         }
 9         while(i<n)
10         {
11             if(A[i]!=elem)
12             {
13                 A[j++]=A[i];
14             }
15             i++;
16         }
17         return j;
18     }
19 };