递归反转单链表。ListNode *reverseList(ListNode *head,ListNode *pNewHead) { if(head == NULL) return pNewHead; ListNode *next = head->next; head->next = pNewHead; return reverseList(next,head); } ListNode* reverseList(ListNode* head) { return reverseList(head,NULL); }
面试中常见链表问题12:单链表反转(递归)
最新推荐文章于 2022-07-30 11:20:23 发布