题目叙述
题解代码(双指针法)
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* pre = NULL;
ListNode* cur = head;
ListNode* tmp;
while(cur!= NULL)
{
tmp = cur->next; //后面要改变cur->next,所以用tmp先保存
cur->next = pre;
pre = cur;
cur = tmp;
}
return pre;
}
};
提交结果