LeetCode Remove 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 len = 0;
        int tmp = A[0];
        for (int i = 0; i < n; i++) {
            if (A[i] != tmp) {
                A[len++] = tmp;
                tmp = A[i];
            }
        }
        A[len++] = tmp;

        return len;
    }
};

LeetCode Remove Duplicates from Sorted Array

原文：http://blog.csdn.net/u011345136/article/details/43867839