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.
Analysis: The logic applied here is the same as in the problem "Remove Duplicates From Sorted Array".
public class Solution {
public int removeElement(int[] A, int elem) {
int len = 0;
for(int i=0; i<A.length; i++) {
if(A[i]!=elem) A[len++]=A[i];
}
return len;
}
}