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

/**
*  struct ListNode {
*        int val;
*        struct ListNode *next;
*        ListNode(int x) :
*              val(x), next(NULL) {
*        }
*  };
*/
class Solution {
public:
    vector<int> printListFromTailToHead(ListNode* head) {
        vector<int> ans;
        //先按照顺序插入vector
        while(head)
        {
            ans.push_back(head->val);
            head = head->next;
        }
        int temp=0;
        //再把得到的结果逆转
        for(int i=0; i<ans.size()/2; i++)
        {
            temp = ans[i];
            ans[i]=ans[ans.size()-1-i];
            ans[ans.size()-1-i] = temp;
        }
        return ans;
    }
};