反转链表-三指针法

1.链接题目链接 https://leetcode.cn/problems/reverse-linked-list/视频链接 https://www.bilibili.com/video/BV1nB4y1i7eL2.反转链表的本质就是把每个节点的next指针从指向后一个节点改为指向前一个节点。3.代码class Solution {public:ListNode* reverseList(ListNode* head) {ListNode* prev nullptr;ListNode* current head;while (current ! nullptr) {ListNode* nextTemp current-next;current-next prev;prev current;current nextTemp;}return prev;}};