【剑指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(ListNode* head) {
13         stack<int>st;
14         vector<int>v;
15         ListNode *node=head;
16         while(node!=NULL)
17         {
18             st.push(node->val);
19             node=node->next;
20         }
21         while(!st.empty())
22         {
23             v.push_back(st.top());
24             st.pop();
25         }
26         return v;
27     }
28 };