给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
提示:
链表中节点的数目范围是 [0, 5000]
-5000 <= Node.val <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/reverse-linked-list
1、改变容器——既然链表不好处理就将其转换成向量处理
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head == nullptr) return head;
vector<int> temp;
ListNode* on = head;
while(on != nullptr)
{
temp.push_back(on->val);
on = on->next;
}
ListNode* on1 = head;
for(int i = 0 ; i < temp.size() ; i++)
{
on1->val = temp[temp.size() - i - 1];
on1 = on1->next;
}
return head;
}
};