Leetcode: Remove Element

class Solution
{
public:
    int removeElement(int A[], int n, int elem)
    {
        int pt = 0;
        for (int i = 0; i < n; i++)
        {
            if (A[i] != elem) A[pt++] = A[i];
        }
        return pt;
    }
};

public class Solution
{
    public int RemoveElement(int[] A, int elem)
    {
        int pt = 0;
        for (int i = 0; i < A.Length; i++)
        {
            if (A[i] != elem) A[pt++] = A[i];
        }
        return pt;
    }
}

class Solution:
    # @param    A       a list of integers
    # @param    elem    an integer, value need to be removed
    # @return an integer
    def removeElement(self, A, elem):
        pt = 0
        for i in range(len(A)):
            if A[i] != elem:
              A[pt] = A[i]
              pt += 1
        return pt

public class Solution
{
    public int removeElement(int[] A, int elem) {
        int pt = 0;
        for (int i = 0; i < A.length; i++)
        {
            if (A[i] != elem) A[pt++] = A[i];
        }
        return pt;
    }
}