Remove Duplicates from Sorted Array

标签：style   io   ar   color   os   sp   for   on   cti   

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

#include<stdio.h>

int removeDuplicates(int A[], int n) {
    int i,k=1;
    int cnt=1;
    if(n==0) return 0;
    for(i=0; i<n-1; i++){
        for(; A[k]<=A[i] && k<n; k++) ;
        A[i+1]=A[k];
        if(k==n-1 && A[i]<=A[k]) break;
    }
    for(i=1;i<n;i++){
        if(A[i]<=A[i-1]) break;
        else cnt++;
    }
    return cnt;
}

void main()
{
    int a[]={1,1,1};
    int n=3;
    int cnt=removeDuplicates(a,n);
    printf("%d\n",cnt);
    for(n=0;n<cnt;n++) printf("%d,",a[n]);
}
~                                    

Remove Duplicates from Sorted Array

标签：style   io   ar   color   os   sp   for   on   cti   

原文地址：http://blog.csdn.net/uj_mosquito/article/details/41487761