class Solution {
public:
int removeElement(int A[], int n, int elem) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int i = 0;
while (i < n) {
if (A[i] == elem) {
n--;
A[i] = A[n];
} else {
i++;
}
}
return n;
}
};
Small Case: 8ms
Large Case: 16ms
Time: O(n)
Space:O(1)