[Leetcode] Remove duplicates from Sorted Array I_leetcode

Given a sorted array, remove the duplicates in place such so each element appear only once and return the new length. Do not allocate extra spaces for another array, and you must does this in place with constant memory. For example, given input array A = [1,1,2], Your function should return length = 2, and A are now [1,2].

Related Issue 1: compressed string

Related issues 2:remove duplicates from Sorted linked list removes duplicate values from the sorted list

Related issues 3:[leetcode] Remove duplicates from Sorted Array II

Code:

    int removeduplicates (int a[], int n) {
        
        if (n==1) return 1;
        if (n==0) return 0;
        
        int i=0, j=1;
        int count = 1;
        
        For (J=1 j<n; j + +)
        {
            if (a[j]!=a[j-1))
            {
                a[i]=a[j-1];
                i++
            }
        }
        
        A[i] = a[j-1];
        i++;
        
        return i;
    }