int remove(type x)
{
int size = currentsize; //currentsize 为序列中元素个数
for(int i = 0; i < currentsize; )
{
if(elements[i] == x)
{
for(int j = i; j < currentsize; j++)
elements[j] = elements[j + 1]; //将i后的元素前移一位
currentsize--;
continue; //删除i后所有与x相等的元素
}
i++;
}
if(size == currentsize)
{
cout << "can't find the element you want to remove!" << endl;
return 0;
}
return 1;
}
remove all the same elements
最新推荐文章于 2018-11-16 15:54:14 发布