逆序输出链表值

先将链表值输出在一个vector中
再将vector逆向输出
/**

• Definition for singly-linked list.
• struct ListNode {

• int val;
  

• ListNode *next;
  

• ListNode(int x) : val(x), next(NULL) {}
  

• };
  /
  class Solution {
  public:
  vector reversePrint(ListNode head)
  {
  vector rep;
  vector neg;
  while (head != NULL)
  {
  rep.push_back(head->val);
  head = head->next;
  }
  for (int i = 0; i<rep.size(); i++)
  {
  neg.push_back(rep[rep.size() - i - 1]);
  }
  return neg;
  }
  };