Remove Element [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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        for(int i = 0; i < n; i++){
            while(elem == A[i] && i + 1 <= n) {
                A[i] = A[n - 1];
                n--;
            }
        }
        return n;
    }
};

Remember to ensure that i + 1 <= n,  not <, considering the last element 

---