1.定义两个结构体,对每个结构体定义一个vector,存放相应的内容,找出两个vector中不同的数据点
int eql1 = 0;
int eql2 = 0;
std::vector<RecvInfo> m_RecvNew;
std::vector<Info> m_SaveRecv;
for (int i = 0; i < m_SaveRecv.size(); i++)
{
for (int j = 0; j < m_RecvNew.size(); j++)
{
if ((strcmp(m_SaveRecv[i].cIdcode, m_RecvNew[j].cIdcode) == 0) &&
(strcmp(m_SaveRecv[i].cDev_no, m_RecvNew[j].cDev_no) == 0))
{
eql1 = 1;
break;
}
else
{
eql1 = 0;
}
}
if (eql1 == 1)
{
continue;
}
printf("[%s] 只有m_SaveRecv容器中有\n", m_SaveRecv[i].cDev_no);
}
for (int m = 0; m < m_RecvNew.size(); m++)
{
for (int k = 0; k < m_SaveRecv.size(); k++)
{
if ((strcmp(m_SaveRecv[k].cIdcode, m_RecvNew[m].cIdcode) == 0) &&
(strcmp(m_SaveRecv[k].cDev_no, m_RecvNew[m].cDev_no) == 0))
{
eql2 = 1;
break;
}
else
{
eql2 = 0;
}
}
if (eql2 == 1)
{
continue;
}
printf("[%s] 只有m_RecvNew容器中有\n", m_SaveRecv[m].cDev_no);
}