while (p)
{
if ((p->data) % 2 == 0)
{
p = p->next;
}
else
{
addToAnotherList(p, B);
prev->next = p->next; // 删除当前节点
delete p;
Node *p = prev->next;
}
}