剑指offer—从头到尾打印链表

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
vector<int> printListFromTailToHead(struct ListNode* head) {
vector<int> lst;
ListNode *p = head;
while (p != NULL)
{
lst.insert(lst.begin(),p->val);
p = p->next;
}
return lst;
}
};