Remove Duplicates from Sorted Array

    public int removeDuplicates(int[] A) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(A.length == 0) return 0;
        int count = 0;
        for(int i = 1; i < A.length; i++) {
            if(A[count] != A[i]) {
                A[count + 1] = A[i];
                count++;
            }
        }
        return count + 1;
    }

Another change: if input {1, 1, 2, 3}, return 2, that means for {2, 3}.

    public int removeDuplicates(int[] A) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(A.length == 0 || A.length == 1) return A.length;
        int slow = 0;
        int fast = 1;
        int count = 0;
        // for the first element
        while(fast < A.length) {
            if(A[fast] != A[slow]) {
                if(fast - slow == 1) {
                    A[count++] = A[slow];
                }
                slow = fast;
            }
            fast++;
        }
        if(A[A.length - 1] != A[A.length - 2]) A[count++] = A[A.length - 1];
        return count;
    }