//输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) :
* val(x), next(NULL) {
* }
* };
*/
class Solution {
public:
vector<int> printListFromTailToHead(ListNode* head)
{
vector<int> vecTmp;
for (ListNode *ptmp = head;NULL != ptmp; ptmp = ptmp->next)
{
vecTmp.push_back(ptmp->val);
}
return vector<int>(vecTmp.rbegin(), vecTmp.rend());
}
};