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

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