[剑指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> list;
int v;
if(head!=NULL){
while(head->next!=NULL){
v = head->val;
list.push_back(v);
head = head->next;
}
v = head->val;
list.push_back(v);
}
reverse(list.begin(),list.end());
return list;
}
};