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

分析：

可以使用 STL，时间复杂度 O(n) ，空间复杂度 O(1)

就一句话……

return distance(A, unique(A, A + n));

代码如下：

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

LeetCode 026 Remove Duplicates from Sorted Array

标签：

原文地址：http://www.cnblogs.com/510602159-Yano/p/4278979.html