妳看這樣能不能滿足妳的需求:
#include?<iostream>#include<algorithm>
#include?<stdlib.h>
using?namespace?std;
#define?N?1000?//定義數組最大為1000;
class?MyARR{
public:
int?a[N];
int?len;?
MyARR(int?b[],int?len){
this->len=len;
for(int?i=0;i<len;++i)? { a[i]=b[i]; } } void?deletesame() { sort(a,a+len); int?l=len; for(int?i=0;i<l-1;++i)? { if(a[i]==a[i+1]) { int?st=a[len-1]; a[len-1]=a[i+1]; ?a[i+1]=st; sort(a,a+len-1); i=-1; len-=1; l-=1; } } } void?show()? { for(int?i=0;i<len;++i)? cout<<a[i]<<"?"; cout<<endl; } }; int?main(){ int?c[]={3,2,1,1,2,3,1,2,3}; MyARR?m(c,9);//初始化傳入數組名和長度? m.deletesame(); m.show(); return?0; }如有疑問可以追問!