一、题目
二、代码
/**
* 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)
{
int i,j;
vector<int> re_vec;
ListNode* process_node=head;
while(process_node!=nullptr)
{
re_vec.push_back(process_node->val);
process_node=process_node->next;
}
process_node=head;
for(i=re_vec.size()-1;i>=0;i--)
{
process_node->val=re_vec[i];
process_node=process_node->next;
}
return head;
}
};