3-12求解题思路和步骤求步骤求解题思路和步骤求解题思路 怎么做怎么做

关注【相关推荐】
Linknode *head2;
void cutLink(Linknode* head)
{
head2 = (Link)malloc(sizeof(Linknode));
head2->next = NULL;
Linknode* r1 = head, * r2 = head2, * p = r1->next;
while (p)
{
if (p->info % 2 != 0)
{
r1->next = p->next;
p->next = r2->next;
r2->next = p;
r2 = p;
}
else {
r1 = p;
}
p = r1->next;
}
}