LeetCode刷题记录：剑指 Offer 06. 从尾到头打印链表

class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
		vector<int> arr;
		
		for (; head != NULL; ) {
			arr.push_back(head->val);
			head = head->next;
		}
		reverse(arr.begin(), arr.end());
		
		return arr;
    }
};