Remove Duplicates from Sorted Array

自己搞定，掌握了in-place的思想

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

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if (n<=1) return n;
        
        int index = 1;
        int elem = A[0];
        for(int i=0;i<n;i++){
            if(A[i]!=elem){
                A[index++] = A[i];
                elem = A[i];
            }
        }
        return index;
        
    }
};

python

class Solution:
    # @param a list of integers
    # @return an integer
    def removeDuplicates(self, A):
        if len(A)<=1:
            return len(A)
            
        index = 1;
        elem = A[0];
        for i in range(1,len(A)):
            if A[i]!=elem:
                A[index] = elem = A[i]
                index += 1
        return index