19,468
社区成员
发帖
与我相关
我的任务
分享
while(pNode->Next)
{
//数据操作
//如果查找到满足条件的node,直接跳过2个即可
if(bFind)
{
pNode = pNodex->NextCol;
if (pNodex->Next)
{
pNode = pNodex->NextCol;
continue;
}
else
{
break;
}
}
//下一个
pNodex = pNodex->NextCol;
}
m_Stru =m_TempStruBegin;
m_uiTempCount1 = 0;
while(m_Stru)
{
if(m_Stru->NextCol!=NULL)
{
m_StruNext =m_Stru->NextCol;//next node
if((m_Stru->ix==m_StruNext->ix)&&(m_Stru->iy == m_StruNext->iy))
{
m_uiTempCount1 ++;
m_TempStruBegin1->NextCol = m_StruNext;//转移满足条件的node到m_TempStruBegin1
m_TempStruBegin1 = m_TempStruBegin1->NextCol;//后移新链表指针
}
}
m_Stru = m_Stru->NextCol;//后移
}
m_Stru =m_TempStruBegin;
m_uiTempCount1 = 0;
while(m_Stru)
{
if(m_Stru->NextCol!=NULL)
{
m_StruNext =m_Stru->NextCol;//next node
if((m_Stru->ix==m_StruNext->ix)&&(m_Stru->iy == m_StruNext->iy))
{
m_uiTempCount1 ++;
m_TempStruBegin1 = m_StruNext;//转移满足条件的node到m_TempStruBegin1
}
}
m_Stru = m_Stru->NextCol;//后移
}
m_Stru =m_TempStruBegin;
while(m_Stru)
{
if(m_Stru->NextCol!=NULL)
{
m_StruNext =m_Stru->NextCol;
if((m_Stru->ix==m_StruNext->ix)&&(m_Stru->iy == m_StruNext->iy))
{
if (m_TempStruBegin1 == NULL)
{
m_uiTempCount1 = 1;
m_TempStruBegin1 = m_StruNext;
m_TempStruEnd1 = m_StruNext;
}
else
{
m_uiTempCount1 ++;
m_TempStruEnd1->NextCol = m_StruNext;
m_TempStruEnd1 = m_StruNext;
}
m_Stru = m_StruNext;
}
else
{
if (m_TempStruBegin1 == NULL)
{
m_uiTempCount1 = 1;
m_TempStruBegin1 = m_Stru;
m_TempStruEnd1 = m_Stru;
}
else
{
m_uiTempCount1 ++;
m_TempStruEnd1->NextCol = m_Stru;
m_TempStruEnd1 = m_Stru;
}
}
}
else
{
m_uiTempCount1 ++;
m_TempStruEnd1->NextCol = m_Stru;
m_TempStruEnd1 = m_Stru;
}
m_Stru = m_Stru->NextCol;
}
else
{
m_uiTempCount1 ++;
m_TempStruEnd1->NextCol = m_Stru;//是不是应该是NULL?
m_TempStruEnd1 = m_Stru;
}