Node * PC = head, *PT
while(PC)
{
PT = PC->next;
PC-> next = PC->prior;
PC->prior = PT;
head = PC;
PC = PT;
}
面试系列之二:C艹翻转双向链表
最新推荐文章于 2024-07-25 18:43:45 发布
Node * PC = head, *PT
while(PC)
{
PT = PC->next;
PC-> next = PC->prior;
PC->prior = PT;
head = PC;
PC = PT;
}