/**
* 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> s;
for(auto x = head; x ;x = x->next) //存储
s.push_back(x->val);
reverse(s.begin(), s.end()); //翻转
return s;
}
};