【leetcode 数组】Remove Duplicates from Sorted Arrayd

题目：

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

Hide Tags

 Array Two Pointers

分析：

遍历一遍，首先找到与A[0]不等的，放到A[1]，再找与A[1]不等的，放到A[2]，以此类推 

代码参考：

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