题目:
![](https://i-blog.csdnimg.cn/blog_migrate/30d2c4ea5cef61f33c26c95efd52d56f.png)
题解思路: 参考力扣官方题解
![](https://i-blog.csdnimg.cn/blog_migrate/2303988e2c51f2d146b0517d30382b7b.png)
代码:
/**
* 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) {
ListNode* pre=NULL;
ListNode* curr=head;
while(curr!=NULL){
ListNode *next=curr->next;
curr->next=pre;
pre=curr;
curr=next;
}
return pre;
}
};