源代码
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head)
{
vector<int> num,sort_num;
ListNode* node=head;
if(node==NULL)
{
return sort_num;
}
while(node!=NULL)
{
int value=node->val;
num.push_back(value);
node=node->next;
}
for(int i=num.size()-1;i>=0;i--)
{
sort_num.push_back(num[i]);
}
return sort_num;
}
};