【LeetCode】Remove Duplicates from Sorted Array

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

两个指针，一个ind指向新数组的当前位置，一个iter遍历原数组，in-place实现。

由于是排好序的，如果A[iter]与A[ind]相同，则iter前进。否则A[iter]赋给A[ind]，iter与ind都前进。

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if(n == 0)
            return 0;
        if(n == 1)
            return 1;

        int ind = 0;
        int iter = 1;

        for(; iter < n; iter ++)
        {
            if(A[iter] == A[ind])
                continue;
            else
                A[++ind] = A[iter];
        }

        return ind+1;
    }
};

【LeetCode】Remove Duplicates from Sorted Array,布布扣,bubuko.com

【LeetCode】Remove Duplicates from Sorted Array

原文：http://www.cnblogs.com/ganganloveu/p/3750598.html