class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* pre = nullptr;
ListNode* temp = head;
while (head != nullptr) {
temp = head->next;
head->next = pre;
pre = head;
head = temp;
}
return pre;
}
};
Leetcode206.反转链表
最新推荐文章于 2024-09-28 12:00:16 发布