牛客网-《剑指offer》-从尾到头打印链表

题目：http://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035

C++

 /**
 *  struct ListNode {
 *        int val;
 *        struct ListNode *next;
 *        ListNode(int x) :
 *              val(x), next(NULL) {
 *        }
 *  };
 */
 class Solution {
 public:
     vector<int> printListFromTailToHead(struct ListNode* head) {
         vector<int> res;
         vector<int>::iterator it;
         ListNode *idx = head;
         while (idx) {
             it = res.begin();
             res.insert(it, idx->val);
             idx = idx->next;
         }
         return res;
     }
 };