面试题5 从尾到头打印链表

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
vector<int> printListFromTailToHead(struct ListNode* head) {
if (head != NULL){
if (head->next != NULL){
printListFromTailToHead(head->next);
}
v.push_back(head->val);
}
return v;
}
vector<int> v;
};