解题思路
代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if (head == nullptr){
return head;
}
ListNode*first = head;
ListNode*second = head->next;
first->next = nullptr;
while (second) {
ListNode*temp = second->next;
second->next = first;
first = second;
second = temp;
}
return first;
}
};