Node* reverse(Node* head)
{
Node* current = head;
Node* reversList = null;
while(current)
{
Node *p = current;
current = current->next;
p->next = reversList;
reverseList = p;
}
return reverseList;
}
[链表]逆转链表
最新推荐文章于 2022-07-20 15:31:12 发布