/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(!head)
return NULL;
ListNode* head1=NULL;
while(head)
{
ListNode* temp=head;
head=head->next;
temp->next=head1;
head1=temp;
}
return head1;
}
};
206. Reverse Linked List
最新推荐文章于 2021-12-11 17:03:19 发布