#include<iostream>
using namespace std;
int rmduplicate(int a[],int n)
{
int insert=1;
for(int i=0;i<n;i++)
{
if(a[i]!=a[insert-1])
{
a[insert]=a[i];
insert++;
}
}
return insert;
}
int main()
{
int a[]={1,1,1,2,2,3,3,3,3,3,4,4};
int p=rmduplicate(a,12);
for(int i=0;i<p;i++)
cout<<a[i];
system("pause");
return 0;
}
TIME COMPLEXITY: O(n);
SPACE COMPLEXITY:O(1);
No comments:
Post a Comment