emove 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]. 
实现代码：
             class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if(n==0) return 0;
        int count=1; //此时数组不为0，至少有1个元素了，所以count设为1；
        for(int i=1;i<n;i++)
        {
            if(A[i-1]==A[i]) 
                continue;  //当前元素与前一个元素相等就跳过；
            else
            {
                A[count]=A[i]; //如果不相等就加入数组；
                count++;
            }
        }
        return count;
    }
};