输入链表头结点,反转该链表并输出反转后链表的头结点
如[2,2,6,8,10],反转为[10,8,6,2,2]
Reverse Linked List
遍历链表,依次往前反转即可
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head&&head->next)
{
ListNode *newHead=reverseList(head->next);
head->next->next=head;
head->next=NULL;
return newHead;
}
return head;
}
};