[LeetCode26]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].

Analysis:

two pointers scan. if A[count]==A[index] continue, else A[++count] = A[index]

Java

public int removeDuplicates(int[] A) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int count = 0;
        if(A.length <= 1)
        	return A.length;
        for(int i=1;i<A.length;i++){
        	if(A[i] != A[count])
        		A[++count] = A[i];
        }
        return count+1;
    }

c++

int removeDuplicates(int A[], int n) {
        if(n == 0) return 0;
        int index = 0;
        for(int i=0; i<n; i++){
            if(A[index] == A[i]){
                continue;
            }
            else{
                A[++index] = A[i];
            }
        }
        return index+1;
    }