public int removeDuplicates(int[] A)

{

if(A == null || A.length == 0) return 0;

int count = 1;

int result = 1;

int start = 1;

for(int i = 1; i < A.length; ++i)

{

if(A[i] != A[i-1] || (A[i] == A[i-1] && count < 2))

{

++result;

count = A[i] != A[i-1] ? 1 : count+1;

A[start++] = A[i]; // Be careful, this statement HAS TO be put after the previous one!

// Otherwise this statement will change A, and lead to wrong judgment

// for A[i] != A[i-1].

}

}

return result;

}

/*public int removeDuplicates(int[] A)