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












這道題目採用雙指針就可以解決問題了,遍歷一遍數組,O(N)複雜度

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





發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章