【Leetcode】206.反转列表 题目描述代码 题目描述 代码 class Solution { public: ListNode* reverseList(ListNode* head) { ListNode* cur = NULL, *pre = head; while (pre != NULL) { ListNode* t = pre->next;//提前要保留下pre的位置 pre->next = cur; cur = pre; pre = t; } return cur; } };