/*链表的头插法。*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head == nullptr || head->next == nullptr) return head;
ListNode node(-1);
node.next = head;
head = head->next;
node.next->next = nullptr;
while(head != nullptr){
ListNode *p = head;
head = head->next;
p->next = node.next;
node.next = p;
}
return node.next;
}
};
LeetCode之Reverse Linked List
最新推荐文章于 2022-01-01 20:28:52 发布