*/
#include<iostream>
#include<set>
using namespace std;
void delete_over_arry(int *a,int len);
void print(int *a ,int len);
int main()
{
   int p[]={1,1,2,5,3,7,3,4,8,2,1,3,9,1};
   print(p,sizeof(p)/sizeof(int));
   delete_over_arry( p,sizeof(p)/sizeof(int));
   print(p,sizeof(p)/sizeof(int));
   return 0;
}
void print(int *a ,int len)
{
  for(int i=0;i<len;i++)
      cout<<a[i];
      cout<<endl;
}
void  delete_over_arry(int *a,int len)
{
       set<int>  temp_set;
       int *set_p=a+1;
       int *new_p=a+1;
       int count=0;
       temp_set.insert(a[0]);
       for(int i=1;i<len;i++)
          {  
             if(temp_set.count(*set_p))
              {
                 set_p++;
                 count++;
              }
              else
              {
                 temp_set.insert(*set_p);
                 *new_p++=*set_p++;
              }
          }
        for(int i=0;i<count;i++)
              *new_p++=0;        
}以下是程序运行结果:
[trageday@lei-yum code_test]$ g++ -o delete_overarray delete_overarray.cpp [trageday@lei-yum code_test]$ ./delete_overarray 11253734821391 12537489000000
原文:http://blog.csdn.net/trageday_motata/article/details/39028947