目录
反转单链表
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点
输入: 1->2->3->4->5->NULL输出: 5->4->3->2->1->NULL
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head == NULL || head->next == NULL)
return head;
ListNode *cur = head;
ListNode *pre = NULL;
ListNode *tmp = NULL;
while(cur){
tmp = cur->next;
cur->next = pre;
pre = cur;
cur = tmp;
}
return pre;
}
};