/**
* 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* prev = nullptr;
//从头开始来进行遍历
//在每一次遍历的节点的过程中, 需要将当前节点的next指针指向前驱结点
ListNode* cur = head;
while (cur) {
auto next = cur -> next;
cur -> next = prev;
prev = cur;
cur = next;
}
return prev;
}
};