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

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

1. 遍历链表
2. 在数组前面插入