题解 | #从尾到头打印链表#

这道题也可以先把链表逆序，然后再打印
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head) {
ListNodepre=nullptr;
ListNodecur=head;
ListNode*Next=head->next;
vector<int>result;
if(head==nullptr)
{
return result;
}
while(cur->next!=nullptr)
{
cur->next=pre;
pre=cur;
cur=Next;
Next=Next->next;
}
cur->next=pre;
while(cur->next!=nullptr)
{
result.push_back(cur->val);
cur=cur->next;
}
result.push_back(cur->val);
return result;
}
};</int></int>