题解：#从尾到头打印链表#

https://www.nowcoder.com/share/jump/5876869471694320610523

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