struct Node{
int data;
Node *next;
};
Node *ReverseLinkList(Node *head){
Node *p = nullptr;
Node *pre = nullptr;
while(head != nullptr){
p = head->next;
head->next = pre;
pre = head;
head = p;
}
return pre;
}
实现链表反转
最新推荐文章于 2024-07-25 16:00:36 发布