剑指 03-—链表从尾到头打印

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/

class solution {
vector<int>printListFromTailToHead(ListNode*head)
{
vector<int>v;
while (head != NULL)
{
v.insert(v.begin(), head->val);
head = head->next;
}
return v;
}
};