in LintCode Algorithm Array ~ read.

Remove Element

LintCode-172.Remove Element

Given an array and a value, remove all occurrences of that value in place and return the new length.

The order of elements can be changed, and the elements after the new length don't matter.

Example: Given an array [0,4,4,0,0,2,4,4], value=4

return 4 and front four elements of the array is [0,0,0,2]

public class Solution {  
     *@param A: A list of integers
     *@param elem: An integer
     *@return: The new length after remove
    public int removeElement(int[] A, int elem) {
        int i = 0;

        for (int j = 0; j < A.length; j++) {
            if (A[j] != elem) {
                A[i] = A[j];

        return i;

Hope this helps,