题目:
Reverse a singly linked list.
解答:
直接记录当前的头,将下一个赋值为当前的头,如此往复 O(n)复杂度
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* phead = NULL;
while(head)
{
ListNode *tmp = head->next;
head->next = phead;
phead = head;
head = tmp;
}
return phead;
}
};