剑指offer 3 : 从尾到头打印链表
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> nums;
        while(head!=NULL)
        {
            nums.push_back(head->val);
            head=head->next;
        }
        reverse(nums.begin(),nums.end());
        return nums;
        
    }
};