leetcode 题解 || Remove Duplicates from Sorted Array 问题

problem：

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

thinking：

（1）要在原址操作，不允许申请额外的数组空间

（2）注意给定的数组是已序的

code：

class Solution {

public:
    int removeDuplicates(int A[], int n) {
        int count=1;
        if(n<2)
            return n;
        for(int i=1;i<n;i++)
        {
            if(A[i]!=A[i-1])
            {
                A[count]=A[i];
                count++;
            }
        }
        return count;
    }
};

leetcode 题解 || Remove Duplicates from Sorted Array 问题

原文：http://blog.csdn.net/hustyangju/article/details/44560557