链表题
Reverse a singly linked list.
翻转链表
习惯加一个头节点比较好写
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode newHead(0);
newHead.next = head;
ListNode *cur = head;
ListNode *pre = NULL;
while(cur != NULL)
{
newHead.next = cur;
cur = cur->next;
newHead.next->next = pre;
pre = newHead.next;
}
return newHead.next;
}
};