题解 | #从尾到头打印链表#

/**

• struct ListNode {

•    int val;
  

•    struct ListNode *next;
  

•    ListNode(int x) :
  

•          val(x), next(NULL) {
  

•    }
  

• }; / class Solution { public: vector printListFromTailToHead(ListNode head) { vector front; vector back; while (head != NULL){ back.push_back(head->val); head = head->next; }; while (!back.empty()){ front.push_back(back.back()); back.pop_back(); }; return front; } };