class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head==NULL||head->next==NULL){
return head;
}
ListNode *former=head,*latter=head->next,*temp;
head->next=NULL;
while(latter!=NULL){
temp=latter->next;
latter->next=former;
former=latter;
latter=temp;
}
return former;
}
};
LeetCode - 206 Reverse Linked List
最新推荐文章于 2022-11-09 11:10:48 发布