ListNode* ReverseList(ListNode* head)
{
if(NULL == head || NULL == head->next)
return head;
ListNode* pnext = head->next;
head->next = NULL;
ListNode* newhead = ReverseList(pnext);
pnext->next = head;
return newhead;
}
单链表逆序
最新推荐文章于 2021-08-15 10:23:10 发布