class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* prev=nullptr;
ListNode* curr=head;
while(curr){
ListNode* nextnode=curr->next;
curr->next=prev;
prev=curr;
curr=nextnode;
}
return prev;
}
};
leetcode---剑指 Offer 24. 反转链表
最新推荐文章于 2024-08-10 22:52:22 发布