/**
* 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==NULL) return head;
ListNode* p=head;
ListNode* pre=NULL;
while(p->next){
ListNode* q=p->next;
p->next=pre;
pre=p;
p=q;
}
p->next=pre;
return p;
}
};
leetcode-Reverse Linked List-206
最新推荐文章于 2024-05-18 16:06:33 发布