剑指offer | 从尾到头打印链表

 1 /**
 2 *  struct ListNode {
 3 *        int val;
 4 *        struct ListNode *next;
 5 *        ListNode(int x) :
 6 *              val(x), next(NULL) {
 7 *        }
 8 *  };
 9 */
10 class Solution {
11 public:
12     vector<int> printListFromTailToHead(struct ListNode* head) {
13         vector<int> nodes;
14         ListNode* pCurtNode = head;
15         while(pCurtNode) {
16             nodes.push_back(pCurtNode->val);
17             pCurtNode = pCurtNode->next;
18         }
19         //也可以在nodes里面逆转
20         vector<int> answer(nodes.rbegin(), nodes.rend());　　//reverse
21         return answer;
22     }
23 };