/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int> printListReversingly(ListNode* head) {
vector<int> res;
for (auto p = head; p; p = p -> next) res.push_back(p -> val);
//此时使用的是反向迭代器, 将数组中的元素从后面往前进行遍历
return vector<int>(res.rbegin(), res.rend());
}
};