Leetcode Remove Duplicates from Sorted Array

数组删除重复元素，要求常数的空间复杂度。比较简单。

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(n == 0 || n == 1)    return n;
        int tmp = A[0], pos = 1, cnt = n;
        for(int i = 1; i < n; i++){
            if(tmp == A[i]){
                cnt--;
            }
            else{
                A[pos] = tmp = A[i];
                pos++;
            }
        }
        return cnt;
    }
};