Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example, Given input array A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

keep comparing the current element in the array with the last non-duplicate element, if it is the same, keep going, if it is not the same increase the non-duplicate count, and set current element as the next non-duplicate element.

public int removeDuplicates(int[] A) {
        if (A==null || A.length==0) {
            return 0;
        }
        //Remove element
        int count = 1;
        for (int i=1; i<A.length; i++) {
            if (A[i] != A[count-1]) {
                A[count] = A[i];
                count = count+1;
            }
        }
        return count;

    }