/**

 *  struct ListNode {

 *        int val;

 *        struct ListNode *next;

 *        ListNode(int x) :

 *              val(x), next(NULL) {

 *        }

 *  };

 */

 class Solution {

 public:

     vector<int> printListFromTailToHead(ListNode* head) {

         vector<int> S;

         ListNode* node = head;

         while(node!=NULL){

             S.insert(S.begin(),node->val);

             node = node->next;

         }

         return S;

     }

 };