//注意问题:删除后,索引会前移,替代原来删除的位置,数组大小减小1
std::vector<int> vecData{1,2,3,4,5,6,7,8,9};
for (auto value : vecData)
{
std::cout << value << " ";
}
std::cout << std::endl;
std::vector<int> vecDelData{ 4,7,8 };
//方法1: --保存不删除的,然后把结果赋值给原始的
std::vector<int> vecRst;
int nCount = vecData.size();
for (int i = 0; i < nCount; i++)
{
bool bFind = false;
int nValue = vecData[i];
int nDelCount = vecDelData.size();
for (int j = 0; j < nDelCount; j++)
{
int nDelValue = vecDelData[j];
if (nValue == nDelValue)
{
bFind = true;
break;
}
}
if (!bFind)
{
vecRst.push_back(nValue);
}
}
vecData = vecRst;
//方法2 --顺序
for (int i = 0; i < nCount; i++)
{
bool bFind = false;
int nValue = vecData[i];
int nDelCount = vecDelData.size();
for (int j = 0; j < nDelCount; j++)
{
int nDelValue = vecDelData[j];
if (nValue == nDelValue)
{
bFind = true;
break;
}
}
if (bFind)
{
vecData.erase(vecData.begin() + i);
i--;
nCount--;
}
}
//方法3:逆序
for (int i = nCount-1; i >= 0; i--)
{
bool bFind = false;
int nValue = vecData[i];
int nDelCount = vecDelData.size();
for (int j = 0; j < nDelCount; j++)
{
int nDelValue = vecDelData[j];
if (nValue == nDelValue)
{
bFind = true;
break;
}
}
if (bFind)
{
vecData.erase(vecData.begin() + i);
}
}
//方法4 --迭代器方法
std::vector<int>::iterator it = vecData.begin();
for (; it != vecData.end(); )
{
bool bFind = false;
int nValue = *it;
int nDelCount = vecDelData.size();
for (int j = 0; j < nDelCount; j++)
{
int nDelValue = vecDelData[j];
if (nValue == nDelValue)
{
bFind = true;
break;
}
}
if (bFind)
{
it = vecData.erase(it);
}
else
{
it++;
}
}
for (auto value : vecData)
{
std::cout << value << " ";
}
std::cout << std::endl;